Base | Representation |
---|---|
bin | 11101011101001110011… |
… | …11101001110100101101 |
3 | 10120202110121101110102200 |
4 | 32232213033221310231 |
5 | 113040312020304401 |
6 | 2052544001012113 |
7 | 133060233235440 |
oct | 16564717516455 |
9 | 3522417343380 |
10 | 1012123213101 |
11 | 36026a193380 |
12 | 1441a6024039 |
13 | 7459ab10910 |
14 | 36db6579657 |
15 | 1b4dac24686 |
hex | eba73e9d2d |
1012123213101 has 48 divisors (see below), whose sum is σ = 1962905642880. Its totient is φ = 485333804160.
The previous prime is 1012123213099. The next prime is 1012123213111. The reversal of 1012123213101 is 1013123212101.
1012123213101 is a `hidden beast` number, since 1 + 0 + 121 + 232 + 1 + 310 + 1 = 666.
It is not a de Polignac number, because 1012123213101 - 21 = 1012123213099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012123213111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56163886 + ... + 56181903.
It is an arithmetic number, because the mean of its divisors is an integer number (40893867560).
Almost surely, 21012123213101 is an apocalyptic number.
1012123213101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012123213101 is a deficient number, since it is larger than the sum of its proper divisors (950782429779).
1012123213101 is a wasteful number, since it uses less digits than its factorization.
1012123213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112345826 (or 112345823 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1012123213101 its reverse (1013123212101), we get a palindrome (2025246425202).
The spelling of 1012123213101 in words is "one trillion, twelve billion, one hundred twenty-three million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •