Base | Representation |
---|---|
bin | 10111011010111111011101… |
… | …010111011111011001111001 |
3 | 111111201122121001121210021121 |
4 | 113122333131113133121321 |
5 | 102000203301113121044 |
6 | 1003030033530105241 |
7 | 30461135466023164 |
oct | 2732773527373171 |
9 | 444648531553247 |
10 | 103009914582649 |
11 | 2a905294356608 |
12 | b678017b7b221 |
13 | 4562a40a571a9 |
14 | 1b619c6794adb |
15 | bd97ce64c984 |
hex | 5dafdd5df679 |
103009914582649 has 8 divisors (see below), whose sum is σ = 105794270424000. Its totient is φ = 100225574746416.
The previous prime is 103009914582647. The next prime is 103009914582713. The reversal of 103009914582649 is 946285419900301.
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 103009914582649 - 21 = 103009914582647 is a prime.
It is a super-2 number, since 2×1030099145826492 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103009914582647) 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, 9667452 + ... + 17305474.
It is an arithmetic number, because the mean of its divisors is an integer number (13224283803000).
Almost surely, 2103009914582649 is an apocalyptic number.
It is an amenable number.
103009914582649 is a deficient number, since it is larger than the sum of its proper divisors (2784355841351).
103009914582649 is an equidigital number, since it uses as much as digits as its factorization.
103009914582649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8002559.
The product of its (nonzero) digits is 16796160, while the sum is 61.
The spelling of 103009914582649 in words is "one hundred three trillion, nine billion, nine hundred fourteen million, five hundred eighty-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •