Base | Representation |
---|---|
bin | 10000010100001110100… |
… | …001111001100111011111 |
3 | 10222012002110111022001210 |
4 | 100110032201321213133 |
5 | 121332234414411111 |
6 | 2215030331035503 |
7 | 144002062502520 |
oct | 20241641714737 |
9 | 3865073438053 |
10 | 1121230232031 |
11 | 3a25692655a8 |
12 | 16137589bb93 |
13 | 81968300b50 |
14 | 3c3a6d0c847 |
15 | 1e27472a0a6 |
hex | 1050e8799df |
1121230232031 has 32 divisors (see below), whose sum is σ = 1865172628480. Its totient is φ = 583316515584.
The previous prime is 1121230232009. The next prime is 1121230232107. The reversal of 1121230232031 is 1302320321211.
It is not a de Polignac number, because 1121230232031 - 211 = 1121230229983 is a prime.
It is a super-2 number, since 2×11212302320312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1121230231989 and 1121230232007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121230232831) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28110691 + ... + 28150548.
It is an arithmetic number, because the mean of its divisors is an integer number (58286644640).
Almost surely, 21121230232031 is an apocalyptic number.
1121230232031 is a deficient number, since it is larger than the sum of its proper divisors (743942396449).
1121230232031 is a wasteful number, since it uses less digits than its factorization.
1121230232031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56261335.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1121230232031 its reverse (1302320321211), we get a palindrome (2423550553242).
The spelling of 1121230232031 in words is "one trillion, one hundred twenty-one billion, two hundred thirty million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •