Base | Representation |
---|---|
bin | 10111000000101100000001… |
… | …000111000000110001000101 |
3 | 111021022211220120222212201110 |
4 | 113000230001013000301011 |
5 | 101231044334222323023 |
6 | 555123413203515233 |
7 | 30213425104125543 |
oct | 2700540107006105 |
9 | 437284816885643 |
10 | 101202333011013 |
11 | 2a278739710a43 |
12 | b425834688b19 |
13 | 4461453b93430 |
14 | 1adc30d11cd93 |
15 | ba77891eca93 |
hex | 5c0b011c0c45 |
101202333011013 has 16 divisors (see below), whose sum is σ = 152964389977280. Its totient is φ = 59000550418944.
The previous prime is 101202333010997. The next prime is 101202333011041. The reversal of 101202333011013 is 310110333202101.
It is a happy number.
It is not a de Polignac number, because 101202333011013 - 24 = 101202333010997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101202333011053) 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, 68287673356 + ... + 68287674837.
It is an arithmetic number, because the mean of its divisors is an integer number (9560274373580).
Almost surely, 2101202333011013 is an apocalyptic number.
101202333011013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101202333011013 is a deficient number, since it is larger than the sum of its proper divisors (51762056966267).
101202333011013 is a wasteful number, since it uses less digits than its factorization.
101202333011013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136575348228.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 101202333011013 its reverse (310110333202101), we get a palindrome (411312666213114).
The spelling of 101202333011013 in words is "one hundred one trillion, two hundred two billion, three hundred thirty-three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •