Base | Representation |
---|---|
bin | 1001001110001111001111… |
… | …1110101101110001010011 |
3 | 1022220101200002121021211210 |
4 | 2103203303332231301103 |
5 | 2312114130311404301 |
6 | 33322203451111203 |
7 | 2064415002620232 |
oct | 223436376556123 |
9 | 38811602537753 |
10 | 10140216122451 |
11 | 325a494712158 |
12 | 11792a9a42503 |
13 | 5872ab72b00c |
14 | 270b09338b19 |
15 | 128b84b05ad6 |
hex | 938f3fadc53 |
10140216122451 has 8 divisors (see below), whose sum is σ = 13526492985280. Its totient is φ = 6757041670632.
The previous prime is 10140216122441. The next prime is 10140216122461. The reversal of 10140216122451 is 15422161204101.
It is an interprime number because it is at equal distance from previous prime (10140216122441) and next prime (10140216122461).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10140216122451 - 211 = 10140216120403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10140216122441) 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, 775595125 + ... + 775608198.
It is an arithmetic number, because the mean of its divisors is an integer number (1690811623160).
Almost surely, 210140216122451 is an apocalyptic number.
10140216122451 is a deficient number, since it is larger than the sum of its proper divisors (3386276862829).
10140216122451 is a wasteful number, since it uses less digits than its factorization.
10140216122451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1551205505.
The product of its (nonzero) digits is 3840, while the sum is 30.
Adding to 10140216122451 its reverse (15422161204101), we get a palindrome (25562377326552).
The spelling of 10140216122451 in words is "ten trillion, one hundred forty billion, two hundred sixteen million, one hundred twenty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •