Base | Representation |
---|---|
bin | 101100011100000110000… |
… | …100010111111000011111 |
3 | 101210221110012210021102210 |
4 | 230130012010113320133 |
5 | 400013212312312101 |
6 | 10254523541051503 |
7 | 433426410641553 |
oct | 54340604277037 |
9 | 11727405707383 |
10 | 3053823557151 |
11 | a7813486a914 |
12 | 413a273b6b93 |
13 | 191c88794583 |
14 | a7b3d36b863 |
15 | 54684b097d6 |
hex | 2c706117e1f |
3053823557151 has 4 divisors (see below), whose sum is σ = 4071764742872. Its totient is φ = 2035882371432.
The previous prime is 3053823557131. The next prime is 3053823557153. The reversal of 3053823557151 is 1517553283503.
3053823557151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 3053823557151 - 223 = 3053815168543 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3053823557151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3053823557153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 508970592856 + ... + 508970592861.
It is an arithmetic number, because the mean of its divisors is an integer number (1017941185718).
Almost surely, 23053823557151 is an apocalyptic number.
3053823557151 is a deficient number, since it is larger than the sum of its proper divisors (1017941185721).
3053823557151 is a wasteful number, since it uses less digits than its factorization.
3053823557151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017941185720.
The product of its (nonzero) digits is 1890000, while the sum is 48.
The spelling of 3053823557151 in words is "three trillion, fifty-three billion, eight hundred twenty-three million, five hundred fifty-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •