Base | Representation |
---|---|
bin | 1101101001000111110001… |
… | …01000101011110110111000 |
3 | 10221012222211010022212000100 |
4 | 12310203320220223312320 |
5 | 12413010424042311412 |
6 | 143445525011035400 |
7 | 6214305331060626 |
oct | 664437050536670 |
9 | 127188733285010 |
10 | 30000223010232 |
11 | 961702886aa32 |
12 | 34462b1b9bb60 |
13 | 13980166c1b77 |
14 | 75a038c3c516 |
15 | 37059467aedc |
hex | 1b48f8a2bdb8 |
30000223010232 has 96 divisors (see below), whose sum is σ = 84785347090080. Its totient is φ = 9565050654720.
The previous prime is 30000223010231. The next prime is 30000223010237. The reversal of 30000223010232 is 23201032200003.
It is a happy number.
30000223010232 is a `hidden beast` number, since 300 + 0 + 0 + 2 + 230 + 102 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30000223010231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73722588 + ... + 74128404.
It is an arithmetic number, because the mean of its divisors is an integer number (883180698855).
Almost surely, 230000223010232 is an apocalyptic number.
It is an amenable number.
30000223010232 is an abundant number, since it is smaller than the sum of its proper divisors (54785124079848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30000223010232 is a wasteful number, since it uses less digits than its factorization.
30000223010232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 450493 (or 450486 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 30000223010232 its reverse (23201032200003), we get a palindrome (53201255210235).
The spelling of 30000223010232 in words is "thirty trillion, two hundred twenty-three million, ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •