Base | Representation |
---|---|
bin | 111110101111000011111… |
… | …101111110110110001110 |
3 | 120021010210202111112012220 |
4 | 332233003331332312032 |
5 | 1031113203320100324 |
6 | 13100302124040210 |
7 | 623320032254112 |
oct | 76570375766616 |
9 | 16233722445186 |
10 | 4311140003214 |
11 | 14123871601a0 |
12 | 597640093066 |
13 | 253700860605 |
14 | 10c935b97742 |
15 | 77221660b79 |
hex | 3ebc3f7ed8e |
4311140003214 has 64 divisors (see below), whose sum is σ = 9577380384000. Its totient is φ = 1282675178240.
The previous prime is 4311140003119. The next prime is 4311140003237. The reversal of 4311140003214 is 4123000411134.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2465992 + ... + 3834500.
It is an arithmetic number, because the mean of its divisors is an integer number (149646568500).
Almost surely, 24311140003214 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4311140003214, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4788690192000).
4311140003214 is an abundant number, since it is smaller than the sum of its proper divisors (5266240380786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4311140003214 is a wasteful number, since it uses less digits than its factorization.
4311140003214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1369393.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 4311140003214 its reverse (4123000411134), we get a palindrome (8434140414348).
The spelling of 4311140003214 in words is "four trillion, three hundred eleven billion, one hundred forty million, three thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •