Base | Representation |
---|---|
bin | 10110110010010000000010… |
… | …000110001010110110011011 |
3 | 111010211000001222111202121021 |
4 | 112302100002012022312123 |
5 | 101113321003300401021 |
6 | 553043534054023311 |
7 | 30051643321533565 |
oct | 2662200206126633 |
9 | 433730058452537 |
10 | 100210212122011 |
11 | 29a25a042a4832 |
12 | b2a54b1347b37 |
13 | 43bba23092264 |
14 | 1aa62b32b2335 |
15 | b8ba6e552c41 |
hex | 5b240218ad9b |
100210212122011 has 4 divisors (see below), whose sum is σ = 102654363637224. Its totient is φ = 97766060606800.
The previous prime is 100210212121973. The next prime is 100210212122039. The reversal of 100210212122011 is 110221212012001.
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 100210212122011 - 215 = 100210212089243 is a prime.
It is a super-2 number, since 2×1002102121220112 (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 (100210212122411) 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, 1222075757545 + ... + 1222075757626.
It is an arithmetic number, because the mean of its divisors is an integer number (25663590909306).
Almost surely, 2100210212122011 is an apocalyptic number.
100210212122011 is a deficient number, since it is larger than the sum of its proper divisors (2444151515213).
100210212122011 is an equidigital number, since it uses as much as digits as its factorization.
100210212122011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2444151515212.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100210212122011 its reverse (110221212012001), we get a palindrome (210431424134012).
The spelling of 100210212122011 in words is "one hundred trillion, two hundred ten billion, two hundred twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •