Base | Representation |
---|---|
bin | 100010011101100000101010… |
… | …010000110111011100111011 |
3 | 201212122010202120110000002121 |
4 | 202131200222100313130323 |
5 | 124331140440320141010 |
6 | 1254202222045542111 |
7 | 43631646426253141 |
oct | 4235405220673473 |
9 | 655563676400077 |
10 | 151561515005755 |
11 | 44323972024988 |
12 | 14bb9778874937 |
13 | 6675260556aba |
14 | 295d88b827591 |
15 | 127c6e203c3da |
hex | 89d82a43773b |
151561515005755 has 8 divisors (see below), whose sum is σ = 184588352604432. Its totient is φ = 119439522272928.
The previous prime is 151561515005731. The next prime is 151561515005759. The reversal of 151561515005755 is 557500515165151.
151561515005755 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 151561515005755 - 25 = 151561515005723 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151561515005759) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 226211216092 + ... + 226211216761.
It is an arithmetic number, because the mean of its divisors is an integer number (23073544075554).
Almost surely, 2151561515005755 is an apocalyptic number.
151561515005755 is a deficient number, since it is larger than the sum of its proper divisors (33026837598677).
151561515005755 is an equidigital number, since it uses as much as digits as its factorization.
151561515005755 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452422432925.
The product of its (nonzero) digits is 3281250, while the sum is 52.
The spelling of 151561515005755 in words is "one hundred fifty-one trillion, five hundred sixty-one billion, five hundred fifteen million, five thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •