Base | Representation |
---|---|
bin | 11100000011011111… |
… | …101100101000110101 |
3 | 2212202100111212211201 |
4 | 130003133230220311 |
5 | 443143043141041 |
6 | 21501041132501 |
7 | 2114325530443 |
oct | 340337545065 |
9 | 85670455751 |
10 | 30123412021 |
11 | 1185897633a |
12 | 5a0832a131 |
13 | 2ac0b15071 |
14 | 165a9b1b93 |
15 | bb48a5631 |
hex | 7037eca35 |
30123412021 has 8 divisors (see below), whose sum is σ = 31920260544. Its totient is φ = 28329328320.
The previous prime is 30123411961. The next prime is 30123412049. The reversal of 30123412021 is 12021432103.
It is a happy number.
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 30123412021 - 213 = 30123403829 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30123412021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30123412061) 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, 668745 + ... + 712366.
It is an arithmetic number, because the mean of its divisors is an integer number (3990032568).
Almost surely, 230123412021 is an apocalyptic number.
It is an amenable number.
30123412021 is a deficient number, since it is larger than the sum of its proper divisors (1796848523).
30123412021 is a wasteful number, since it uses less digits than its factorization.
30123412021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1382411.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 30123412021 its reverse (12021432103), we get a palindrome (42144844124).
The spelling of 30123412021 in words is "thirty billion, one hundred twenty-three million, four hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •