Base | Representation |
---|---|
bin | 1001001110010111011000… |
… | …1011111001100000110100 |
3 | 1022220121022100010002022210 |
4 | 2103211312023321200310 |
5 | 2312133114024212000 |
6 | 33323204324253420 |
7 | 2064523066535445 |
oct | 223456613714064 |
9 | 38817270102283 |
10 | 10142400616500 |
11 | 3260405810939 |
12 | 11797b9541270 |
13 | 587569190949 |
14 | 270c754db2cc |
15 | 128c617ad350 |
hex | 939762f9834 |
10142400616500 has 48 divisors (see below), whose sum is σ = 29534670599616. Its totient is φ = 2704640164000.
The previous prime is 10142400616499. The next prime is 10142400616511. The reversal of 10142400616500 is 561600424101.
10142400616500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3380798706 + ... + 3380801705.
It is an arithmetic number, because the mean of its divisors is an integer number (615305637492).
Almost surely, 210142400616500 is an apocalyptic number.
10142400616500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10142400616500 is an abundant number, since it is smaller than the sum of its proper divisors (19392269983116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10142400616500 is a wasteful number, since it uses less digits than its factorization.
10142400616500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6761600433 (or 6761600421 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 10142400616500 in words is "ten trillion, one hundred forty-two billion, four hundred million, six hundred sixteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •