Base | Representation |
---|---|
bin | 10100100101101100011… |
… | …110110001000100100110 |
3 | 12000021000022200200100120 |
4 | 110211230132301010212 |
5 | 141140120221320110 |
6 | 3001551335022410 |
7 | 204135440436255 |
oct | 24455436610446 |
9 | 5007008620316 |
10 | 1414864245030 |
11 | 4a6049a87615 |
12 | 1aa26320aa06 |
13 | a35622a0b32 |
14 | 4c6a07b279c |
15 | 26c0d0aa870 |
hex | 1496c7b1126 |
1414864245030 has 64 divisors (see below), whose sum is σ = 3490808555520. Its totient is φ = 366746292864.
The previous prime is 1414864245001. The next prime is 1414864245071. The reversal of 1414864245030 is 305424684141.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 539887 + ... + 1766693.
It is an arithmetic number, because the mean of its divisors is an integer number (54543883680).
Almost surely, 21414864245030 is an apocalyptic number.
1414864245030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1414864245030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1745404277760).
1414864245030 is an abundant number, since it is smaller than the sum of its proper divisors (2075944310490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414864245030 is a wasteful number, since it uses less digits than its factorization.
1414864245030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1227893.
The product of its (nonzero) digits is 368640, while the sum is 42.
The spelling of 1414864245030 in words is "one trillion, four hundred fourteen billion, eight hundred sixty-four million, two hundred forty-five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •