Base | Representation |
---|---|
bin | 1110101100010110010011… |
… | …1110000111011000010010 |
3 | 2010012102001022211001000100 |
4 | 3223011210332013120102 |
5 | 4104141033344130020 |
6 | 54205311310433230 |
7 | 3255110411221602 |
oct | 353054476073022 |
9 | 63172038731010 |
10 | 16155066005010 |
11 | 5169363664119 |
12 | 198ab62b02816 |
13 | 90255449666a |
14 | 3dbca3432c02 |
15 | 1d036c5eda90 |
hex | eb164f87612 |
16155066005010 has 24 divisors (see below), whose sum is σ = 42003171613260. Its totient is φ = 4308017601312.
The previous prime is 16155066004937. The next prime is 16155066005033. The reversal of 16155066005010 is 1050066055161.
16155066005010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 15572944310049 + 582121694961 = 3946257^2 + 762969^2 .
It is a super-2 number, since 2×161550660050102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 89750366605 + ... + 89750366784.
Almost surely, 216155066005010 is an apocalyptic number.
16155066005010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16155066005010 is an abundant number, since it is smaller than the sum of its proper divisors (25848105608250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16155066005010 is a wasteful number, since it uses less digits than its factorization.
16155066005010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179500733402 (or 179500733399 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 16155066005010 in words is "sixteen trillion, one hundred fifty-five billion, sixty-six million, five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •