Base | Representation |
---|---|
bin | 110111111001001011… |
… | …0111111011000001110 |
3 | 102110211010001110022012 |
4 | 1233302112333120032 |
5 | 3431310214330110 |
6 | 131050252221222 |
7 | 11446314056414 |
oct | 1576226773016 |
9 | 373733043265 |
10 | 120030230030 |
11 | 469a4a32417 |
12 | 1b319a6a812 |
13 | b41b53cc69 |
14 | 5b493752b4 |
15 | 31c7977905 |
hex | 1bf25bf60e |
120030230030 has 16 divisors (see below), whose sum is σ = 218481993360. Its totient is φ = 47472629952.
The previous prime is 120030229961. The next prime is 120030230053. The reversal of 120030230030 is 30032030021.
It is a super-2 number, since 2×1200302300302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120030229987 and 120030230014.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 67431824 + ... + 67433603.
It is an arithmetic number, because the mean of its divisors is an integer number (13655124585).
Almost surely, 2120030230030 is an apocalyptic number.
120030230030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120030230030 is a deficient number, since it is larger than the sum of its proper divisors (98451763330).
120030230030 is a wasteful number, since it uses less digits than its factorization.
120030230030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134865523.
The product of its (nonzero) digits is 108, while the sum is 14.
Adding to 120030230030 its reverse (30032030021), we get a palindrome (150062260051).
Subtracting from 120030230030 its reverse (30032030021), we obtain a square (89998200009 = 2999972).
The spelling of 120030230030 in words is "one hundred twenty billion, thirty million, two hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •