Base | Representation |
---|---|
bin | 111000000100100101… |
… | …1001001101000111110 |
3 | 102111210210022022011000 |
4 | 1300021023021220332 |
5 | 3433101212033202 |
6 | 131152244311130 |
7 | 11461642426515 |
oct | 1601113115076 |
9 | 374723268130 |
10 | 120413002302 |
11 | 4708100093a |
12 | 1b4060a24a6 |
13 | b47c92bc28 |
14 | 5b8413367c |
15 | 31eb38691c |
hex | 1c092c9a3e |
120413002302 has 16 divisors (see below), whose sum is σ = 267584449680. Its totient is φ = 40137667416.
The previous prime is 120413002271. The next prime is 120413002319. The reversal of 120413002302 is 203200314021.
120413002302 is a `hidden beast` number, since 1 + 20 + 41 + 300 + 2 + 302 = 666.
It is a super-2 number, since 2×1204130023022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 7 ways as a sum of consecutive naturals, for example, 1114935153 + ... + 1114935260.
It is an arithmetic number, because the mean of its divisors is an integer number (16724028105).
Almost surely, 2120413002302 is an apocalyptic number.
120413002302 is an abundant number, since it is smaller than the sum of its proper divisors (147171447378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120413002302 is a wasteful number, since it uses less digits than its factorization.
120413002302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2229870424 (or 2229870418 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 120413002302 its reverse (203200314021), we get a palindrome (323613316323).
The spelling of 120413002302 in words is "one hundred twenty billion, four hundred thirteen million, two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •