Base | Representation |
---|---|
bin | 11101100111000110010110… |
… | …101010111100101101011100 |
3 | 122002002212222201200020011001 |
4 | 131213012112222330231130 |
5 | 114032143003143120012 |
6 | 1140550535312040044 |
7 | 36300552350623315 |
oct | 3547062652745534 |
9 | 562085881606131 |
10 | 130230231223132 |
11 | 3854a370480857 |
12 | 127335a8b33024 |
13 | 5788872b36371 |
14 | 24232692b760c |
15 | 100c8c1abc357 |
hex | 767196abcb5c |
130230231223132 has 12 divisors (see below), whose sum is σ = 230159369043576. Its totient is φ = 64470411496400.
The previous prime is 130230231223121. The next prime is 130230231223133. The reversal of 130230231223132 is 231322132032031.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 130230231223132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130230231223133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 161176028338 + ... + 161176029145.
It is an arithmetic number, because the mean of its divisors is an integer number (19179947420298).
Almost surely, 2130230231223132 is an apocalyptic number.
It is an amenable number.
130230231223132 is a deficient number, since it is larger than the sum of its proper divisors (99929137820444).
130230231223132 is a wasteful number, since it uses less digits than its factorization.
130230231223132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322352057588 (or 322352057586 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 130230231223132 its reverse (231322132032031), we get a palindrome (361552363255163).
The spelling of 130230231223132 in words is "one hundred thirty trillion, two hundred thirty billion, two hundred thirty-one million, two hundred twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •