Base | Representation |
---|---|
bin | 101101101101001000001111… |
… | …101110000001101001100100 |
3 | 222100201200112002211122111110 |
4 | 231231020033232001221210 |
5 | 202321400241204023022 |
6 | 1551304125032305020 |
7 | 60224506351535016 |
oct | 5555101756015144 |
9 | 870650462748443 |
10 | 201013323111012 |
11 | 5905a2a9542795 |
12 | 1a66588b242170 |
13 | 8821623859659 |
14 | 378d14d6a41b6 |
15 | 1838c402ce00c |
hex | b6d20fb81a64 |
201013323111012 has 24 divisors (see below), whose sum is σ = 469054832614816. Its totient is φ = 67001048843328.
The previous prime is 201013323110983. The next prime is 201013323111061. The reversal of 201013323111012 is 210111323310102.
It is a super-2 number, since 2×2010133231110122 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201013323111012.
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 7 ways as a sum of consecutive naturals, for example, 423777298 + ... + 424251369.
Almost surely, 2201013323111012 is an apocalyptic number.
It is an amenable number.
201013323111012 is an abundant number, since it is smaller than the sum of its proper divisors (268041509503804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201013323111012 is a wasteful number, since it uses less digits than its factorization.
201013323111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 848048427 (or 848048425 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 201013323111012 its reverse (210111323310102), we get a palindrome (411124646421114).
The spelling of 201013323111012 in words is "two hundred one trillion, thirteen billion, three hundred twenty-three million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •