Base | Representation |
---|---|
bin | 101111110011010000001000… |
… | …100001111000001000010001 |
3 | 1000120100210220021002221210202 |
4 | 233303100020201320020101 |
5 | 210023402423242143433 |
6 | 2023042231024504545 |
7 | 62165426252163455 |
oct | 5763201041701021 |
9 | 1016323807087722 |
10 | 210230202302993 |
11 | 60a93145567854 |
12 | 1b6b403147b155 |
13 | 903c8139b0c72 |
14 | 39cb2a60a0665 |
15 | 1948883be1ee8 |
hex | bf3408878211 |
210230202302993 has 32 divisors (see below), whose sum is σ = 223160948778240. Its totient is φ = 197653732024320.
The previous prime is 210230202302977. The next prime is 210230202303013. The reversal of 210230202302993 is 399203202032012.
It is a cyclic number.
It is not a de Polignac number, because 210230202302993 - 24 = 210230202302977 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (210230202302963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 132376205 + ... + 133954917.
It is an arithmetic number, because the mean of its divisors is an integer number (6973779649320).
Almost surely, 2210230202302993 is an apocalyptic number.
210230202302993 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
210230202302993 is a deficient number, since it is larger than the sum of its proper divisors (12930746475247).
210230202302993 is a wasteful number, since it uses less digits than its factorization.
210230202302993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1579289.
The product of its (nonzero) digits is 69984, while the sum is 38.
The spelling of 210230202302993 in words is "two hundred ten trillion, two hundred thirty billion, two hundred two million, three hundred two thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •