Base | Representation |
---|---|
bin | 101100011011110100110… |
… | …100111110111100001011 |
3 | 101210220201001112000011002 |
4 | 230123310310332330023 |
5 | 400012114240411110 |
6 | 10254435125325215 |
7 | 433416266246060 |
oct | 54336464767413 |
9 | 11726631460132 |
10 | 3053534310155 |
11 | a77aa657030a |
12 | 41396656680b |
13 | 191c4088ccc4 |
14 | a7b12b96c67 |
15 | 54669521aa5 |
hex | 2c6f4d3ef0b |
3053534310155 has 8 divisors (see below), whose sum is σ = 4187704196832. Its totient is φ = 2093852098368.
The previous prime is 3053534310007. The next prime is 3053534310161. The reversal of 3053534310155 is 5510134353503.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3053534310155 - 222 = 3053530115851 is a prime.
It is a super-2 number, since 2×30535343101552 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43621918682 + ... + 43621918751.
It is an arithmetic number, because the mean of its divisors is an integer number (523463024604).
Almost surely, 23053534310155 is an apocalyptic number.
3053534310155 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3053534310155 is a deficient number, since it is larger than the sum of its proper divisors (1134169886677).
3053534310155 is an equidigital number, since it uses as much as digits as its factorization.
3053534310155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87243837445.
The product of its (nonzero) digits is 202500, while the sum is 38.
Adding to 3053534310155 its reverse (5510134353503), we get a palindrome (8563668663658).
The spelling of 3053534310155 in words is "three trillion, fifty-three billion, five hundred thirty-four million, three hundred ten thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •