Base | Representation |
---|---|
bin | 1001001110010111100111… |
… | …1111100110000111110011 |
3 | 1022220121110210022201022011 |
4 | 2103211321333212013303 |
5 | 2312133231403001321 |
6 | 33323214525423351 |
7 | 2064524503536361 |
oct | 223457177460763 |
9 | 38817423281264 |
10 | 10142464500211 |
11 | 326043888469a |
12 | 1179816a0ab57 |
13 | 58757949a564 |
14 | 270c7dbaa631 |
15 | 128c671cbae1 |
hex | 93979fe61f3 |
10142464500211 has 4 divisors (see below), whose sum is σ = 10142480223424. Its totient is φ = 10142448777000.
The previous prime is 10142464500173. The next prime is 10142464500227. The reversal of 10142464500211 is 11200546424101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10142464500211 - 213 = 10142464492019 is a prime.
It is a super-2 number, since 2×101424645002112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10142464500811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6850680 + ... + 8198581.
It is an arithmetic number, because the mean of its divisors is an integer number (2535620055856).
Almost surely, 210142464500211 is an apocalyptic number.
10142464500211 is a deficient number, since it is larger than the sum of its proper divisors (15723213).
10142464500211 is an equidigital number, since it uses as much as digits as its factorization.
10142464500211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15723212.
The product of its (nonzero) digits is 7680, while the sum is 31.
The spelling of 10142464500211 in words is "ten trillion, one hundred forty-two billion, four hundred sixty-four million, five hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •