Base | Representation |
---|---|
bin | 100010010110001000111100… |
… | …0100011010101100111010100 |
3 | 1110121200102202212211202000210 |
4 | 1010230101320203111213110 |
5 | 304044232311131131012 |
6 | 2550311232253205420 |
7 | 120430504660605666 |
oct | 10454217043254724 |
9 | 1417612685752023 |
10 | 302110022130132 |
11 | 88297160556087 |
12 | 29a72b43190870 |
13 | cc75b11913c28 |
14 | 54862bb3ca536 |
15 | 24dd89585623c |
hex | 112c4788d59d4 |
302110022130132 has 96 divisors (see below), whose sum is σ = 735817811097600. Its totient is φ = 96292780974720.
The previous prime is 302110022130131. The next prime is 302110022130173. The reversal of 302110022130132 is 231031220011203.
It is a junction number, because it is equal to n+sod(n) for n = 302110022130099 and 302110022130108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302110022130131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18046107282 + ... + 18046124022.
It is an arithmetic number, because the mean of its divisors is an integer number (7664768865600).
Almost surely, 2302110022130132 is an apocalyptic number.
It is an amenable number.
302110022130132 is an abundant number, since it is smaller than the sum of its proper divisors (433707788967468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302110022130132 is a wasteful number, since it uses less digits than its factorization.
302110022130132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34693 (or 34691 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 302110022130132 its reverse (231031220011203), we get a palindrome (533141242141335).
The spelling of 302110022130132 in words is "three hundred two trillion, one hundred ten billion, twenty-two million, one hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •