Base | Representation |
---|---|
bin | 1001000111110100110010… |
… | …0101011100100110011110 |
3 | 1022111212021021121012110000 |
4 | 2101331030211130212132 |
5 | 2303313002040133204 |
6 | 33155422255355130 |
7 | 2053434403145211 |
oct | 221751445344636 |
9 | 38455237535400 |
10 | 10030033521054 |
11 | 32177934929a8 |
12 | 115ba79b22aa6 |
13 | 579a9c459161 |
14 | 269655bc1778 |
15 | 125d8698e039 |
hex | 91f4c95c99e |
10030033521054 has 20 divisors (see below), whose sum is σ = 22474704741984. Its totient is φ = 3343344506964.
The previous prime is 10030033521043. The next prime is 10030033521097. The reversal of 10030033521054 is 45012533003001.
10030033521054 is a `hidden beast` number, since 1 + 0 + 0 + 300 + 3 + 352 + 1 + 0 + 5 + 4 = 666.
It is a super-2 number, since 2×100300335210542 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 9 ways as a sum of consecutive naturals, for example, 30956893422 + ... + 30956893745.
Almost surely, 210030033521054 is an apocalyptic number.
10030033521054 is an abundant number, since it is smaller than the sum of its proper divisors (12444671220930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10030033521054 is an equidigital number, since it uses as much as digits as its factorization.
10030033521054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61913787181 (or 61913787172 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 10030033521054 its reverse (45012533003001), we get a palindrome (55042566524055).
The spelling of 10030033521054 in words is "ten trillion, thirty billion, thirty-three million, five hundred twenty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •