Base | Representation |
---|---|
bin | 10001111001101001000… |
… | …100000110111000011101 |
3 | 11100121011102001212211010 |
4 | 101321221010012320131 |
5 | 130123243033043401 |
6 | 2341035540045433 |
7 | 154605413535540 |
oct | 21715104067035 |
9 | 4317142055733 |
10 | 1230123331101 |
11 | 434768607655 |
12 | 17a4a5993879 |
13 | 8c0003a1c92 |
14 | 437770b8857 |
15 | 21ee9576ed6 |
hex | 11e69106e1d |
1230123331101 has 16 divisors (see below), whose sum is σ = 1874793656448. Its totient is φ = 702807614400.
The previous prime is 1230123331079. The next prime is 1230123331109. The reversal of 1230123331101 is 1011333210321.
It is a happy number.
It is not a de Polignac number, because 1230123331101 - 26 = 1230123331037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230123331109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4874130 + ... + 5120291.
It is an arithmetic number, because the mean of its divisors is an integer number (117174603528).
Almost surely, 21230123331101 is an apocalyptic number.
It is an amenable number.
1230123331101 is a deficient number, since it is larger than the sum of its proper divisors (644670325347).
1230123331101 is an equidigital number, since it uses as much as digits as its factorization.
1230123331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000292.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1230123331101 its reverse (1011333210321), we get a palindrome (2241456541422).
The spelling of 1230123331101 in words is "one trillion, two hundred thirty billion, one hundred twenty-three million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •