Base | Representation |
---|---|
bin | 10110110010001111110110… |
… | …001010110101110110000001 |
3 | 111010210222120000222112101021 |
4 | 112302033312022311312001 |
5 | 101113320101034120342 |
6 | 553043502145105441 |
7 | 30051635341643230 |
oct | 2662176612656601 |
9 | 433728500875337 |
10 | 100210012020097 |
11 | 29a25911352251 |
12 | b2a5456328281 |
13 | 43bb9c07a0765 |
14 | 1aa62948a4b17 |
15 | b8ba5bbc8567 |
hex | 5b23f62b5d81 |
100210012020097 has 4 divisors (see below), whose sum is σ = 114525728022976. Its totient is φ = 85894296017220.
The previous prime is 100210012020091. The next prime is 100210012020101. The reversal of 100210012020097 is 790020210012001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100210012020097 - 223 = 100210003631489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100210012020091) 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, 7157858001429 + ... + 7157858001442.
It is an arithmetic number, because the mean of its divisors is an integer number (28631432005744).
Almost surely, 2100210012020097 is an apocalyptic number.
It is an amenable number.
100210012020097 is a deficient number, since it is larger than the sum of its proper divisors (14315716002879).
100210012020097 is an equidigital number, since it uses as much as digits as its factorization.
100210012020097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14315716002878.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 100210012020097 its reverse (790020210012001), we get a palindrome (890230222032098).
The spelling of 100210012020097 in words is "one hundred trillion, two hundred ten billion, twelve million, twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •