Base | Representation |
---|---|
bin | 10111000110010111… |
… | …01000010010010100 |
3 | 1012000021102222000200 |
4 | 23203023220102110 |
5 | 200344230124340 |
6 | 5410325140500 |
7 | 616214153562 |
oct | 134313502224 |
9 | 35007388020 |
10 | 12401411220 |
11 | 5294300890 |
12 | 24a125a730 |
13 | 122837b563 |
14 | 85906ca32 |
15 | 4c8b12330 |
hex | 2e32e8494 |
12401411220 has 72 divisors (see below), whose sum is σ = 41037403680. Its totient is φ = 3006402240.
The previous prime is 12401411177. The next prime is 12401411237. The reversal of 12401411220 is 2211410421.
12401411220 is a `hidden beast` number, since 1 + 2 + 401 + 41 + 1 + 220 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 12401411193 and 12401411202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3129690 + ... + 3133649.
It is an arithmetic number, because the mean of its divisors is an integer number (569963940).
Almost surely, 212401411220 is an apocalyptic number.
12401411220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12401411220 is an abundant number, since it is smaller than the sum of its proper divisors (28635992460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12401411220 is a wasteful number, since it uses less digits than its factorization.
12401411220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6263365 (or 6263360 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 12401411220 its reverse (2211410421), we get a palindrome (14612821641).
The spelling of 12401411220 in words is "twelve billion, four hundred one million, four hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •