Base | Representation |
---|---|
bin | 111000000100110010… |
… | …1111101011001000111 |
3 | 102111211021112100100222 |
4 | 1300021211331121013 |
5 | 3433110011430043 |
6 | 131153055054555 |
7 | 11462056236506 |
oct | 1601145753107 |
9 | 374737470328 |
10 | 120420030023 |
11 | 47084a70977 |
12 | 1b40851145b |
13 | b48121c947 |
14 | 5b8504283d |
15 | 31ebcc3d68 |
hex | 1c0997d647 |
120420030023 has 8 divisors (see below), whose sum is σ = 129849583920. Its totient is φ = 111299641920.
The previous prime is 120420030019. The next prime is 120420030097. The reversal of 120420030023 is 320030024021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120420030023 - 22 = 120420030019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120420029983 and 120420030010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120420030323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77290640 + ... + 77292197.
It is an arithmetic number, because the mean of its divisors is an integer number (16231197990).
Almost surely, 2120420030023 is an apocalyptic number.
120420030023 is a deficient number, since it is larger than the sum of its proper divisors (9429553897).
120420030023 is a wasteful number, since it uses less digits than its factorization.
120420030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154582897.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 120420030023 its reverse (320030024021), we get a palindrome (440450054044).
The spelling of 120420030023 in words is "one hundred twenty billion, four hundred twenty million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •