Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1010001101111001101100 |
3 | 1022110001010212120222021000 |
4 | 2101223132022031321230 |
5 | 2303010012230120022 |
6 | 33142553531040300 |
7 | 2052161636436036 |
oct | 221533612157154 |
9 | 38401125528230 |
10 | 10011001020012 |
11 | 320a7070a91a3 |
12 | 1158247ba0090 |
13 | 57805834c215 |
14 | 26876c1c6c56 |
15 | 125620b346ac |
hex | 91ade28de6c |
10011001020012 has 48 divisors (see below), whose sum is σ = 25954623946720. Its totient is φ = 3336977601216.
The previous prime is 10011001019983. The next prime is 10011001020103. The reversal of 10011001020012 is 21002010011001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10011001019976 and 10011001020003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24842838 + ... + 25242594.
Almost surely, 210011001020012 is an apocalyptic number.
10011001020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10011001020012 is an abundant number, since it is smaller than the sum of its proper divisors (15943622926708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011001020012 is a wasteful number, since it uses less digits than its factorization.
10011001020012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631647 (or 631639 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10011001020012 its reverse (21002010011001), we get a palindrome (31013011031013).
The spelling of 10011001020012 in words is "ten trillion, eleven billion, one million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •