Base | Representation |
---|---|
bin | 1001010001110001101110… |
… | …0110001001101100110001 |
3 | 1100010012120221121012122001 |
4 | 2110130123212021230301 |
5 | 2314113132120022113 |
6 | 33410140205414001 |
7 | 2101666355000260 |
oct | 224343346115461 |
9 | 40105527535561 |
10 | 10201010314033 |
11 | 32832514230a0 |
12 | 118903586a301 |
13 | 58cc49886346 |
14 | 273a354845d7 |
15 | 12a541e347dd |
hex | 9471b989b31 |
10201010314033 has 16 divisors (see below), whose sum is σ = 12988741515264. Its totient is φ = 7779714964560.
The previous prime is 10201010314007. The next prime is 10201010314049. The reversal of 10201010314033 is 33041301010201.
It is not a de Polignac number, because 10201010314033 - 213 = 10201010305841 is a prime.
It is a super-2 number, since 2×102010103140332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10201010314033.
It is not an unprimeable number, because it can be changed into a prime (10201010314073) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1409365035 + ... + 1409372272.
It is an arithmetic number, because the mean of its divisors is an integer number (811796344704).
Almost surely, 210201010314033 is an apocalyptic number.
It is an amenable number.
10201010314033 is a deficient number, since it is larger than the sum of its proper divisors (2787731201231).
10201010314033 is a wasteful number, since it uses less digits than its factorization.
10201010314033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2818737372.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10201010314033 its reverse (33041301010201), we get a palindrome (43242311324234).
The spelling of 10201010314033 in words is "ten trillion, two hundred one billion, ten million, three hundred fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •