Base | Representation |
---|---|
bin | 100011010010100001010111… |
… | …011100101101110000101011 |
3 | 202100112101200212022202021110 |
4 | 203102201113130231300223 |
5 | 130320332110232303030 |
6 | 1310031530340441403 |
7 | 44456101564306020 |
oct | 4322412734556053 |
9 | 670471625282243 |
10 | 155204405353515 |
11 | 454a8900719251 |
12 | 154a77a13a9263 |
13 | 687a935837cab |
14 | 2a47d0cd93547 |
15 | 12e2351c1a1b0 |
hex | 8d285772dc2b |
155204405353515 has 32 divisors (see below), whose sum is σ = 288612550402560. Its totient is φ = 69748033008384.
The previous prime is 155204405353381. The next prime is 155204405353609. The reversal of 155204405353515 is 515353504402551.
155204405353515 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 155204405353515 - 213 = 155204405345323 is a prime.
It is a super-2 number, since 2×1552044053535152 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12526580194 + ... + 12526592583.
It is an arithmetic number, because the mean of its divisors is an integer number (9019142200080).
Almost surely, 2155204405353515 is an apocalyptic number.
155204405353515 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
155204405353515 is a deficient number, since it is larger than the sum of its proper divisors (133408145049045).
155204405353515 is a wasteful number, since it uses less digits than its factorization.
155204405353515 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25053172851.
The product of its (nonzero) digits is 4500000, while the sum is 48.
The spelling of 155204405353515 in words is "one hundred fifty-five trillion, two hundred four billion, four hundred five million, three hundred fifty-three thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •