Base | Representation |
---|---|
bin | 1001010111111000001000… |
… | …1100001001000011111101 |
3 | 1100111020002200010200022001 |
4 | 2111332002030021003331 |
5 | 2322322300023422104 |
6 | 33530231335022301 |
7 | 2112366412061644 |
oct | 225760214110375 |
9 | 40436080120261 |
10 | 10305810764029 |
11 | 3313740560340 |
12 | 11a540320a991 |
13 | 599aaba97131 |
14 | 278b37ca035b |
15 | 12d127809aa4 |
hex | 95f823090fd |
10305810764029 has 8 divisors (see below), whose sum is σ = 11301564971520. Its totient is φ = 9319866943200.
The previous prime is 10305810764021. The next prime is 10305810764057. The reversal of 10305810764029 is 92046701850301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10305810764029 - 23 = 10305810764021 is a prime.
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 10305810764029.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10305810764021) 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, 2452594464 + ... + 2452598665.
It is an arithmetic number, because the mean of its divisors is an integer number (1412695621440).
It is a 1-persistent number, because it is pandigital, but 2⋅10305810764029 = 20611621528058 is not.
Almost surely, 210305810764029 is an apocalyptic number.
It is an amenable number.
10305810764029 is a deficient number, since it is larger than the sum of its proper divisors (995754207491).
10305810764029 is a wasteful number, since it uses less digits than its factorization.
10305810764029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4905193331.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 10305810764029 in words is "ten trillion, three hundred five billion, eight hundred ten million, seven hundred sixty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •