Base | Representation |
---|---|
bin | 11101011101001110100… |
… | …00111010111011010101 |
3 | 10120202110122000100010101 |
4 | 32232213100322323111 |
5 | 113040312111422201 |
6 | 2052544012054101 |
7 | 133060236121111 |
oct | 16564720727325 |
9 | 3522418010111 |
10 | 1012123545301 |
11 | 36026a39aa20 |
12 | 1441a6164331 |
13 | 7459abc8b9b |
14 | 36db6624741 |
15 | 1b4dac8cd01 |
hex | eba743aed5 |
1012123545301 has 16 divisors (see below), whose sum is σ = 1173754555200. Its totient is φ = 863054784000.
The previous prime is 1012123545269. The next prime is 1012123545311. The reversal of 1012123545301 is 1035453212101.
It is not a de Polignac number, because 1012123545301 - 25 = 1012123545269 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1012123545301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012123545311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23952636 + ... + 23994853.
It is an arithmetic number, because the mean of its divisors is an integer number (73359659700).
Almost surely, 21012123545301 is an apocalyptic number.
1012123545301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012123545301 is a deficient number, since it is larger than the sum of its proper divisors (161631009899).
1012123545301 is a wasteful number, since it uses less digits than its factorization.
1012123545301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47947620.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 1012123545301 its reverse (1035453212101), we get a palindrome (2047576757402).
The spelling of 1012123545301 in words is "one trillion, twelve billion, one hundred twenty-three million, five hundred forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •