Base | Representation |
---|---|
bin | 10111000100011100001100… |
… | …000011011110101010001001 |
3 | 111022020111112210211121010221 |
4 | 113010130030003132222021 |
5 | 101244311004424001014 |
6 | 555442102410510041 |
7 | 30241154463103024 |
oct | 2704341403365211 |
9 | 438214483747127 |
10 | 101460214672009 |
11 | 2a368043135806 |
12 | b467804735321 |
13 | 447c870b0054b |
14 | 1b0a9b45d21bb |
15 | bae32de38b24 |
hex | 5c470c0dea89 |
101460214672009 has 2 divisors, whose sum is σ = 101460214672010. Its totient is φ = 101460214672008.
The previous prime is 101460214671971. The next prime is 101460214672057. The reversal of 101460214672009 is 900276412064101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60932387046400 + 40527827625609 = 7805920^2 + 6366147^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101460214672009 is a prime.
It is a super-3 number, since 3×1014602146720093 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (101460214672099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50730107336004 + 50730107336005.
It is an arithmetic number, because the mean of its divisors is an integer number (50730107336005).
Almost surely, 2101460214672009 is an apocalyptic number.
It is an amenable number.
101460214672009 is a deficient number, since it is larger than the sum of its proper divisors (1).
101460214672009 is an equidigital number, since it uses as much as digits as its factorization.
101460214672009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 43.
The spelling of 101460214672009 in words is "one hundred one trillion, four hundred sixty billion, two hundred fourteen million, six hundred seventy-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •