Base | Representation |
---|---|
bin | 110111111000010100… |
… | …0010011001001010010 |
3 | 102110202002110020102202 |
4 | 1233300220103021102 |
5 | 3431230302304020 |
6 | 131043334243202 |
7 | 11445512323610 |
oct | 1576050231122 |
9 | 373662406382 |
10 | 120001213010 |
11 | 4698a613508 |
12 | 1b3101b6502 |
13 | b415520523 |
14 | 5b455806b0 |
15 | 31c5144e75 |
hex | 1bf0a13252 |
120001213010 has 32 divisors (see below), whose sum is σ = 247663785600. Its totient is φ = 41009248512.
The previous prime is 120001212983. The next prime is 120001213037. The reversal of 120001213010 is 10312100021.
It is an interprime number because it is at equal distance from previous prime (120001212983) and next prime (120001213037).
It is a super-2 number, since 2×1200012130102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120001212982 and 120001213000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2770535 + ... + 2813514.
It is an arithmetic number, because the mean of its divisors is an integer number (7739493300).
Almost surely, 2120001213010 is an apocalyptic number.
120001213010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120001213010 is an abundant number, since it is smaller than the sum of its proper divisors (127662572590).
120001213010 is a wasteful number, since it uses less digits than its factorization.
120001213010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5584370.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 120001213010 its reverse (10312100021), we get a palindrome (130313313031).
The spelling of 120001213010 in words is "one hundred twenty billion, one million, two hundred thirteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •