Base | Representation |
---|---|
bin | 1100001110101100000… |
… | …0111011100101010111 |
3 | 202002022022200220120020 |
4 | 3003223000323211113 |
5 | 11420241414220043 |
6 | 240304052240223 |
7 | 21115335516420 |
oct | 3035300734527 |
9 | 662268626506 |
10 | 210101320023 |
11 | 81115799471 |
12 | 34876610073 |
13 | 16a73cc2c0a |
14 | a25189a647 |
15 | 56ea197e83 |
hex | 30eb03b957 |
210101320023 has 64 divisors (see below), whose sum is σ = 337926930432. Its totient is φ = 113517676800.
The previous prime is 210101319947. The next prime is 210101320027. The reversal of 210101320023 is 320023101012.
It is not a de Polignac number, because 210101320023 - 28 = 210101319767 is a prime.
It is a super-3 number, since 3×2101013200233 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210101319984 and 210101320011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210101320027) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29895636 + ... + 29902662.
It is an arithmetic number, because the mean of its divisors is an integer number (5280108288).
Almost surely, 2210101320023 is an apocalyptic number.
210101320023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
210101320023 is a deficient number, since it is larger than the sum of its proper divisors (127825610409).
210101320023 is a wasteful number, since it uses less digits than its factorization.
210101320023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7764.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 210101320023 its reverse (320023101012), we get a palindrome (530124421035).
The spelling of 210101320023 in words is "two hundred ten billion, one hundred one million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •