Base | Representation |
---|---|
bin | 11100001011110010… |
… | …00111001000001110 |
3 | 1110001112002210021020 |
4 | 32011321013020032 |
5 | 221442044234042 |
6 | 10541243015010 |
7 | 1043652305100 |
oct | 160571071016 |
9 | 43045083236 |
10 | 15131243022 |
11 | 6465212925 |
12 | 2b2350a466 |
13 | 1571aab54c |
14 | a37829570 |
15 | 5d85db3ec |
hex | 385e4720e |
15131243022 has 48 divisors (see below), whose sum is σ = 35284897872. Its totient is φ = 4313191680.
The previous prime is 15131243021. The next prime is 15131243041. The reversal of 15131243022 is 22034213151.
It is a junction number, because it is equal to n+sod(n) for n = 15131242983 and 15131243001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15131243021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67872 + ... + 186732.
It is an arithmetic number, because the mean of its divisors is an integer number (735102039).
Almost surely, 215131243022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15131243022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17642448936).
15131243022 is an abundant number, since it is smaller than the sum of its proper divisors (20153654850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15131243022 is a wasteful number, since it uses less digits than its factorization.
15131243022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119313 (or 119306 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 15131243022 its reverse (22034213151), we get a palindrome (37165456173).
The spelling of 15131243022 in words is "fifteen billion, one hundred thirty-one million, two hundred forty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •