Base | Representation |
---|---|
bin | 1000110100011101001… |
… | …1011001000011000110 |
3 | 112111002200211122220110 |
4 | 2031013103121003012 |
5 | 4440303122333110 |
6 | 153335110013450 |
7 | 13642544530665 |
oct | 2150723310306 |
9 | 474080748813 |
10 | 151520121030 |
11 | 59294181623 |
12 | 25447947286 |
13 | 11399497c65 |
14 | 7495610ddc |
15 | 3e1c2a0a20 |
hex | 23474d90c6 |
151520121030 has 64 divisors (see below), whose sum is σ = 367850911680. Its totient is φ = 39938697216.
The previous prime is 151520121023. The next prime is 151520121089. The reversal of 151520121030 is 30121025151.
It is a junction number, because it is equal to n+sod(n) for n = 151520120988 and 151520121006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10867944 + ... + 10881876.
It is an arithmetic number, because the mean of its divisors is an integer number (5747670495).
Almost surely, 2151520121030 is an apocalyptic number.
151520121030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
151520121030 is an abundant number, since it is smaller than the sum of its proper divisors (216330790650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151520121030 is a wasteful number, since it uses less digits than its factorization.
151520121030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18105.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 151520121030 its reverse (30121025151), we get a palindrome (181641146181).
The spelling of 151520121030 in words is "one hundred fifty-one billion, five hundred twenty million, one hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •