Base | Representation |
---|---|
bin | 1001000111001111011010… |
… | …1010010011101100000001 |
3 | 1022110220101011120011010112 |
4 | 2101303312222103230001 |
5 | 2303131431004120342 |
6 | 33151043025441105 |
7 | 2052630663613556 |
oct | 221636652235401 |
9 | 38426334504115 |
10 | 10020002020097 |
11 | 3213505a12843 |
12 | 1159b3a4a0195 |
13 | 578b6108c784 |
14 | 268d837bca2d |
15 | 12599ae5c682 |
hex | 91cf6a93b01 |
10020002020097 has 4 divisors (see below), whose sum is σ = 10025019549396. Its totient is φ = 10014984490800.
The previous prime is 10020002020081. The next prime is 10020002020153. The reversal of 10020002020097 is 79002020002001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5688458732401 + 4331543287696 = 2385049^2 + 2081236^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020002020097 - 24 = 10020002020081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020002020037) 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, 2508761654 + ... + 2508765647.
It is an arithmetic number, because the mean of its divisors is an integer number (2506254887349).
Almost surely, 210020002020097 is an apocalyptic number.
It is an amenable number.
10020002020097 is a deficient number, since it is larger than the sum of its proper divisors (5017529299).
10020002020097 is an equidigital number, since it uses as much as digits as its factorization.
10020002020097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5017529298.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 10020002020097 its reverse (79002020002001), we get a palindrome (89022022022098).
The spelling of 10020002020097 in words is "ten trillion, twenty billion, two million, twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •