Base | Representation |
---|---|
bin | 1101000000011000011100… |
… | …0000010000101111101011 |
3 | 1212122002100022010001020210 |
4 | 3100012013000100233223 |
5 | 3333243313021334011 |
6 | 50225232025152203 |
7 | 3004104363646425 |
oct | 320060700205753 |
9 | 55562308101223 |
10 | 14300211121131 |
11 | 461375a410361 |
12 | 172b58792b663 |
13 | 7c9672731ab0 |
14 | 3761c3649815 |
15 | 19beabdb16a6 |
hex | d0187010beb |
14300211121131 has 32 divisors (see below), whose sum is σ = 21096361431040. Its totient is φ = 8559137165184.
The previous prime is 14300211121129. The next prime is 14300211121187. The reversal of 14300211121131 is 13112111200341.
It is a happy number.
It is not a de Polignac number, because 14300211121131 - 21 = 14300211121129 is a prime.
It is a super-2 number, since 2×143002111211312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14300211121098 and 14300211121107.
It is not an unprimeable number, because it can be changed into a prime (14300211101131) 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, 2101146 + ... + 5745888.
It is an arithmetic number, because the mean of its divisors is an integer number (659261294720).
Almost surely, 214300211121131 is an apocalyptic number.
14300211121131 is a deficient number, since it is larger than the sum of its proper divisors (6796150309909).
14300211121131 is a wasteful number, since it uses less digits than its factorization.
14300211121131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3647515.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 14300211121131 its reverse (13112111200341), we get a palindrome (27412322321472).
The spelling of 14300211121131 in words is "fourteen trillion, three hundred billion, two hundred eleven million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •