Base | Representation |
---|---|
bin | 1001001110100010011011… |
… | …1101110110010000110110 |
3 | 1022220212222000221121011212 |
4 | 2103220212331312100312 |
5 | 2312210202311003111 |
6 | 33324414513401422 |
7 | 2064656432250344 |
oct | 223504675662066 |
9 | 38825860847155 |
10 | 10145366500406 |
11 | 326169799a365 |
12 | 117a2a6869272 |
13 | 58791c78b837 |
14 | 271077382994 |
15 | 128d86d6398b |
hex | 93a26f76436 |
10145366500406 has 8 divisors (see below), whose sum is σ = 15879704087664. Its totient is φ = 4852131804520.
The previous prime is 10145366500387. The next prime is 10145366500411. The reversal of 10145366500406 is 60400566354101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101453665004062 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110275722785 + ... + 110275722876.
It is an arithmetic number, because the mean of its divisors is an integer number (1984963010958).
Almost surely, 210145366500406 is an apocalyptic number.
10145366500406 is a deficient number, since it is larger than the sum of its proper divisors (5734337587258).
10145366500406 is a wasteful number, since it uses less digits than its factorization.
10145366500406 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220551445686.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 10145366500406 in words is "ten trillion, one hundred forty-five billion, three hundred sixty-six million, five hundred thousand, four hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •