Base | Representation |
---|---|
bin | 1101101001101100101010… |
… | …01110110100010111000100 |
3 | 10221021212221111220100112201 |
4 | 12310312111032310113010 |
5 | 12413322010202341122 |
6 | 143503002250124244 |
7 | 6215606221535512 |
oct | 664662516642704 |
9 | 127255844810481 |
10 | 30020030121412 |
11 | 9624472423801 |
12 | 344a0bb420684 |
13 | 1399b521321b6 |
14 | 75ad976734b2 |
15 | 370d534e4a27 |
hex | 1b4d953b45c4 |
30020030121412 has 6 divisors (see below), whose sum is σ = 52535052712478. Its totient is φ = 15010015060704.
The previous prime is 30020030121409. The next prime is 30020030121421. The reversal of 30020030121412 is 21412103002003.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 21741554630656 + 8278475490756 = 4662784^2 + 2877234^2 .
It is a super-3 number, since 3×300200301214123 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30020030121412.
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 as a sum of consecutive naturals, namely, 3752503765173 + ... + 3752503765180.
Almost surely, 230020030121412 is an apocalyptic number.
It is an amenable number.
30020030121412 is a deficient number, since it is larger than the sum of its proper divisors (22515022591066).
30020030121412 is a wasteful number, since it uses less digits than its factorization.
30020030121412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7505007530357 (or 7505007530355 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 30020030121412 its reverse (21412103002003), we get a palindrome (51432133123415).
The spelling of 30020030121412 in words is "thirty trillion, twenty billion, thirty million, one hundred twenty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •