Base | Representation |
---|---|
bin | 11011100000111101001110… |
… | …100001100111011101001010 |
3 | 120212110122011210211112101002 |
4 | 123200331032201213131022 |
5 | 111330130104334000020 |
6 | 1105212053251055002 |
7 | 34326554455562360 |
oct | 3340751641473512 |
9 | 525418153745332 |
10 | 121012021000010 |
11 | 35615a01094358 |
12 | 116a4b34ba1462 |
13 | 526a50000066a |
14 | 21c5027bdd630 |
15 | decc013d9975 |
hex | 6e0f4e86774a |
121012021000010 has 64 divisors (see below), whose sum is σ = 253759649783040. Its totient is φ = 40689737303040.
The previous prime is 121012021000009. The next prime is 121012021000051. The reversal of 121012021000010 is 10000120210121.
It is a super-2 number, since 2×1210120210000102 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121012020999955 and 121012021000000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33060239 + ... + 36537698.
It is an arithmetic number, because the mean of its divisors is an integer number (3964994527860).
Almost surely, 2121012021000010 is an apocalyptic number.
121012021000010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121012021000010 is an abundant number, since it is smaller than the sum of its proper divisors (132747628783030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121012021000010 is a wasteful number, since it uses less digits than its factorization.
121012021000010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69598431.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 121012021000010 its reverse (10000120210121), we get a palindrome (131012141210131).
The spelling of 121012021000010 in words is "one hundred twenty-one trillion, twelve billion, twenty-one million, ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •