Base | Representation |
---|---|
bin | 10010001110000001110… |
… | …100010110001000001001 |
3 | 11102200122222012221212121 |
4 | 102032001310112020021 |
5 | 131003110421403441 |
6 | 2355100025411241 |
7 | 156312026604265 |
oct | 22160164261011 |
9 | 4380588187777 |
10 | 1252013466121 |
11 | 442a80a64030 |
12 | 182794939b21 |
13 | 910ab5381b2 |
14 | 4485241b0a5 |
15 | 2287b202dd1 |
hex | 12381d16209 |
1252013466121 has 8 divisors (see below), whose sum is σ = 1365850702944. Its totient is φ = 1138179201120.
The previous prime is 1252013466103. The next prime is 1252013466149. The reversal of 1252013466121 is 1216643102521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1252013466121 - 211 = 1252013464073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1252013466521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 188746 + ... + 1593628.
It is an arithmetic number, because the mean of its divisors is an integer number (170731337868).
Almost surely, 21252013466121 is an apocalyptic number.
1252013466121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1252013466121 is a deficient number, since it is larger than the sum of its proper divisors (113837236823).
1252013466121 is a wasteful number, since it uses less digits than its factorization.
1252013466121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1485911.
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 1252013466121 its reverse (1216643102521), we get a palindrome (2468656568642).
The spelling of 1252013466121 in words is "one trillion, two hundred fifty-two billion, thirteen million, four hundred sixty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •