Base | Representation |
---|---|
bin | 1001000111111101010101… |
… | …1110001101000101111001 |
3 | 1022112002012100000120000201 |
4 | 2101333111132031011321 |
5 | 2303332203001213423 |
6 | 33200442215202201 |
7 | 2053545330563665 |
oct | 221772536150571 |
9 | 38462170016021 |
10 | 10032330101113 |
11 | 3218761888551 |
12 | 11603bb076361 |
13 | 57a0771a4778 |
14 | 2697d2bdd8a5 |
15 | 125e6d3d72ad |
hex | 91fd578d179 |
10032330101113 has 8 divisors (see below), whose sum is σ = 10033824797000. Its totient is φ = 10030835543040.
The previous prime is 10032330101081. The next prime is 10032330101137. The reversal of 10032330101113 is 31110103323001.
It can be written as a sum of positive squares in 4 ways, for example, as 28248197184 + 10004081903929 = 168072^2 + 3162923^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10032330101113 - 25 = 10032330101081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10032330101153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 313680583 + ... + 313712563.
It is an arithmetic number, because the mean of its divisors is an integer number (1254228099625).
Almost surely, 210032330101113 is an apocalyptic number.
It is an amenable number.
10032330101113 is a deficient number, since it is larger than the sum of its proper divisors (1494695887).
10032330101113 is a wasteful number, since it uses less digits than its factorization.
10032330101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68907.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10032330101113 its reverse (31110103323001), we get a palindrome (41142433424114).
The spelling of 10032330101113 in words is "ten trillion, thirty-two billion, three hundred thirty million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •