Base | Representation |
---|---|
bin | 100001101011001101110… |
… | …000110010001011111001 |
3 | 22012020012201012002120110 |
4 | 201223031300302023321 |
5 | 300403331444214001 |
6 | 4531034152214533 |
7 | 326122441614663 |
oct | 41531560621371 |
9 | 8166181162513 |
10 | 2314144523001 |
11 | 812472287613 |
12 | 3145b639a449 |
13 | 13a2b8903acc |
14 | 80010369533 |
15 | 402e231b3d6 |
hex | 21acdc322f9 |
2314144523001 has 32 divisors (see below), whose sum is σ = 3146450780160. Its totient is φ = 1512548777600.
The previous prime is 2314144522969. The next prime is 2314144523039. The reversal of 2314144523001 is 1003254414132.
2314144523001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2314144523001 - 25 = 2314144522969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2314144523001.
It is not an unprimeable number, because it can be changed into a prime (2314144524001) 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, 143969101 + ... + 143985173.
It is an arithmetic number, because the mean of its divisors is an integer number (98326586880).
Almost surely, 22314144523001 is an apocalyptic number.
It is an amenable number.
2314144523001 is a deficient number, since it is larger than the sum of its proper divisors (832306257159).
2314144523001 is a wasteful number, since it uses less digits than its factorization.
2314144523001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19877.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 2314144523001 its reverse (1003254414132), we get a palindrome (3317398937133).
The spelling of 2314144523001 in words is "two trillion, three hundred fourteen billion, one hundred forty-four million, five hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •