Base | Representation |
---|---|
bin | 1001001110100001110101… |
… | …0111101101000010011010 |
3 | 1022220212112211000020122120 |
4 | 2103220131113231002122 |
5 | 2312204340102144302 |
6 | 33324350523002110 |
7 | 2064652435650444 |
oct | 223503527550232 |
9 | 38825484006576 |
10 | 10145205506202 |
11 | 3261615028aa8 |
12 | 117a260969336 |
13 | 5878c53106b0 |
14 | 27105dc35494 |
15 | 128d77b619bc |
hex | 93a1d5ed09a |
10145205506202 has 64 divisors (see below), whose sum is σ = 22807558803456. Its totient is φ = 2985055634880.
The previous prime is 10145205506201. The next prime is 10145205506209. The reversal of 10145205506202 is 20260550254101.
10145205506202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (10145205506201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5735293 + ... + 7292735.
It is an arithmetic number, because the mean of its divisors is an integer number (356368106304).
Almost surely, 210145205506202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10145205506202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11403779401728).
10145205506202 is an abundant number, since it is smaller than the sum of its proper divisors (12662353297254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10145205506202 is a wasteful number, since it uses less digits than its factorization.
10145205506202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1561115.
The product of its (nonzero) digits is 24000, while the sum is 33.
The spelling of 10145205506202 in words is "ten trillion, one hundred forty-five billion, two hundred five million, five hundred six thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.286 sec. • engine limits •