Base | Representation |
---|---|
bin | 1001001110100001001010… |
… | …0001111111010011000101 |
3 | 1022220212002010211011001001 |
4 | 2103220102201333103011 |
5 | 2312204002023344221 |
6 | 33324320505133301 |
7 | 2064645100143403 |
oct | 223502241772305 |
9 | 38825063734031 |
10 | 10145023653061 |
11 | 3261531410050 |
12 | 117a20ba8a231 |
13 | 58789673b19b |
14 | 271043a18473 |
15 | 128d66bde391 |
hex | 93a1287f4c5 |
10145023653061 has 16 divisors (see below), whose sum is σ = 11649926108160. Its totient is φ = 8737237309680.
The previous prime is 10145023653049. The next prime is 10145023653071. The reversal of 10145023653061 is 16035632054101.
It is a de Polignac number, because none of the positive numbers 2k-10145023653061 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 10145023653061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145023653031) 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, 21204100 + ... + 21677266.
It is an arithmetic number, because the mean of its divisors is an integer number (728120381760).
Almost surely, 210145023653061 is an apocalyptic number.
10145023653061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10145023653061 is a deficient number, since it is larger than the sum of its proper divisors (1504902455099).
10145023653061 is a wasteful number, since it uses less digits than its factorization.
10145023653061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575784.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 10145023653061 in words is "ten trillion, one hundred forty-five billion, twenty-three million, six hundred fifty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •