Base | Representation |
---|---|
bin | 101111010001111011100… |
… | …011010100001101001110 |
3 | 102111121102010220021211021 |
4 | 233101323203110031032 |
5 | 411213042420144100 |
6 | 10524333513544354 |
7 | 453510636304042 |
oct | 57217343241516 |
9 | 12447363807737 |
10 | 3249068131150 |
11 | 1042a16291086 |
12 | 4458364150ba |
13 | 1a75028178ba |
14 | b3381a54022 |
15 | 597b0838a1a |
hex | 2f47b8d434e |
3249068131150 has 48 divisors (see below), whose sum is σ = 6376025502000. Its totient is φ = 1228382184960.
The previous prime is 3249068131129. The next prime is 3249068131151. The reversal of 3249068131150 is 511318609423.
It is a junction number, because it is equal to n+sod(n) for n = 3249068131097 and 3249068131106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3249068131151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3537925 + ... + 4360624.
It is an arithmetic number, because the mean of its divisors is an integer number (132833864625).
Almost surely, 23249068131150 is an apocalyptic number.
3249068131150 is a deficient number, since it is larger than the sum of its proper divisors (3126957370850).
3249068131150 is a wasteful number, since it uses less digits than its factorization.
3249068131150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7899013 (or 7899008 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 3249068131150 in words is "three trillion, two hundred forty-nine billion, sixty-eight million, one hundred thirty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •