Base | Representation |
---|---|
bin | 1001001010010110011000… |
… | …1010000010010011001111 |
3 | 1022200000020102021020002220 |
4 | 2102211212022002103033 |
5 | 2310020322011403030 |
6 | 33231354531350423 |
7 | 2056531355030511 |
oct | 222454612022317 |
9 | 38600212236086 |
10 | 10073412216015 |
11 | 3234123645525 |
12 | 1168365452413 |
13 | 580bc34b50b5 |
14 | 26b7acdb1bb1 |
15 | 127074dc0a10 |
hex | 929662824cf |
10073412216015 has 32 divisors (see below), whose sum is σ = 16289496315840. Its totient is φ = 5315287412736.
The previous prime is 10073412216013. The next prime is 10073412216017. The reversal of 10073412216015 is 51061221437001.
It is an interprime number because it is at equal distance from previous prime (10073412216013) and next prime (10073412216017).
It is not a de Polignac number, because 10073412216015 - 21 = 10073412216013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10073412216011) by changing a digit.
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, 3476992 + ... + 5677701.
It is an arithmetic number, because the mean of its divisors is an integer number (509046759870).
Almost surely, 210073412216015 is an apocalyptic number.
10073412216015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10073412216015 is a deficient number, since it is larger than the sum of its proper divisors (6216084099825).
10073412216015 is a wasteful number, since it uses less digits than its factorization.
10073412216015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9155483.
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 10073412216015 in words is "ten trillion, seventy-three billion, four hundred twelve million, two hundred sixteen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •