Base | Representation |
---|---|
bin | 10001101000110001100… |
… | …011010101001110001111 |
3 | 11021212102012122011222202 |
4 | 101220301203111032033 |
5 | 124324200100414043 |
6 | 2324442442032115 |
7 | 153364535030612 |
oct | 21506143251617 |
9 | 4255365564882 |
10 | 1212012123023 |
11 | 428014278999 |
12 | 176a904a863b |
13 | 8a3a5105500 |
14 | 429399c0179 |
15 | 217d95531b8 |
hex | 11a318d538f |
1212012123023 has 12 divisors (see below), whose sum is σ = 1312530880968. Its totient is φ = 1118682059040.
The previous prime is 1212012123011. The next prime is 1212012123043. The reversal of 1212012123023 is 3203212102121.
It is a de Polignac number, because none of the positive numbers 2k-1212012123023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212012122986 and 1212012123004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212012123043) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1648733 + ... + 2267673.
It is an arithmetic number, because the mean of its divisors is an integer number (109377573414).
Almost surely, 21212012123023 is an apocalyptic number.
1212012123023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1212012123023 is a deficient number, since it is larger than the sum of its proper divisors (100518757945).
1212012123023 is a wasteful number, since it uses less digits than its factorization.
1212012123023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630554 (or 630541 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1212012123023 its reverse (3203212102121), we get a palindrome (4415224225144).
The spelling of 1212012123023 in words is "one trillion, two hundred twelve billion, twelve million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •