Base | Representation |
---|---|
bin | 1001010010011110111000… |
… | …0010111100011110101100 |
3 | 1100011100212122211110111000 |
4 | 2110213232002330132230 |
5 | 2314312443014341022 |
6 | 33415503030200300 |
7 | 2102605623143205 |
oct | 224475602743654 |
9 | 40140778743430 |
10 | 10213131012012 |
11 | 3288401222965 |
12 | 118b458ab3090 |
13 | 59112ba2a696 |
14 | 2744651205ac |
15 | 12aa010976ac |
hex | 949ee0bc7ac |
10213131012012 has 24 divisors (see below), whose sum is σ = 26478487809200. Its totient is φ = 3404377003968.
The previous prime is 10213131011987. The next prime is 10213131012053. The reversal of 10213131012012 is 21021013131201.
10213131012012 is a `hidden beast` number, since 10 + 213 + 1 + 310 + 120 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 47283013837 + ... + 47283014052.
Almost surely, 210213131012012 is an apocalyptic number.
10213131012012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10213131012012 is an abundant number, since it is smaller than the sum of its proper divisors (16265356797188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10213131012012 is a wasteful number, since it uses less digits than its factorization.
10213131012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94566027902 (or 94566027894 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10213131012012 its reverse (21021013131201), we get a palindrome (31234144143213).
The spelling of 10213131012012 in words is "ten trillion, two hundred thirteen billion, one hundred thirty-one million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.398 sec. • engine limits •