Base | Representation |
---|---|
bin | 10100101101010010001… |
… | …100101011111010110111 |
3 | 12001001001020110010101022 |
4 | 110231102030223322313 |
5 | 141303312341413221 |
6 | 3005420120051355 |
7 | 204544410620546 |
oct | 24552214537267 |
9 | 5031036403338 |
10 | 1423013232311 |
11 | 4a9550965350 |
12 | 1ab958303b5b |
13 | a4260649bb8 |
14 | 4cc34b8015d |
15 | 270386d54ab |
hex | 14b5232beb7 |
1423013232311 has 16 divisors (see below), whose sum is σ = 1560117931008. Its totient is φ = 1287204307200.
The previous prime is 1423013232241. The next prime is 1423013232313. The reversal of 1423013232311 is 1132323103241.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1423013232311 - 230 = 1421939490487 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1423013232313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4803896 + ... + 5091506.
It is an arithmetic number, because the mean of its divisors is an integer number (97507370688).
Almost surely, 21423013232311 is an apocalyptic number.
1423013232311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1423013232311 is a deficient number, since it is larger than the sum of its proper divisors (137104698697).
1423013232311 is a wasteful number, since it uses less digits than its factorization.
1423013232311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289862.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 1423013232311 its reverse (1132323103241), we get a palindrome (2555336335552).
The spelling of 1423013232311 in words is "one trillion, four hundred twenty-three billion, thirteen million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •