Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …110011110001010111001010 |
3 | 111010002212121101001122002212 |
4 | 112233111223303301113022 |
5 | 101102031212242033002 |
6 | 552412003233025122 |
7 | 30031331026455530 |
oct | 2657255363612712 |
9 | 433085541048085 |
10 | 100010122221002 |
11 | 2995906680a684 |
12 | b27276b6b51a2 |
13 | 43a5bb6257226 |
14 | 1a9a7312ac150 |
15 | b8675d271352 |
hex | 5af56bcf15ca |
100010122221002 has 8 divisors (see below), whose sum is σ = 171445923807456. Its totient is φ = 42861480951852.
The previous prime is 100010122220999. The next prime is 100010122221007. The reversal of 100010122221002 is 200122221010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 7143580158643 = 100010122221002 / (1 + 0 + 0 + 0 + 1 + 0 + 1 + 2 + 2 + 2 + 2 + 1 + 0 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (100010122221007) 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, 3571790079308 + ... + 3571790079335.
It is an arithmetic number, because the mean of its divisors is an integer number (21430740475932).
Almost surely, 2100010122221002 is an apocalyptic number.
100010122221002 is a deficient number, since it is larger than the sum of its proper divisors (71435801586454).
100010122221002 is an equidigital number, since it uses as much as digits as its factorization.
100010122221002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7143580158652.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100010122221002 its reverse (200122221010001), we get a palindrome (300132343231003).
The spelling of 100010122221002 in words is "one hundred trillion, ten billion, one hundred twenty-two million, two hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •