Base | Representation |
---|---|
bin | 1001010001110011010011… |
… | …0111111111111011100111 |
3 | 1100010020200111122011210010 |
4 | 2110130310313333323213 |
5 | 2314120014203014030 |
6 | 33410250235501303 |
7 | 2102013024603513 |
oct | 224346467777347 |
9 | 40106614564703 |
10 | 10201434423015 |
11 | 3283449865490 |
12 | 11891338b7833 |
13 | 58ccb66b93c4 |
14 | 273a75923143 |
15 | 12a5692ab6b0 |
hex | 94734dffee7 |
10201434423015 has 32 divisors (see below), whose sum is σ = 17880024552192. Its totient is φ = 4925626560000.
The previous prime is 10201434423013. The next prime is 10201434423049. The reversal of 10201434423015 is 51032443410201.
It is not a de Polignac number, because 10201434423015 - 21 = 10201434423013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201434423013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128231761 + ... + 128311290.
It is an arithmetic number, because the mean of its divisors is an integer number (558750767256).
Almost surely, 210201434423015 is an apocalyptic number.
10201434423015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10201434423015 is a deficient number, since it is larger than the sum of its proper divisors (7678590129177).
10201434423015 is a wasteful number, since it uses less digits than its factorization.
10201434423015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256543311.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 10201434423015 its reverse (51032443410201), we get a palindrome (61233877833216).
The spelling of 10201434423015 in words is "ten trillion, two hundred one billion, four hundred thirty-four million, four hundred twenty-three thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •