Base | Representation |
---|---|
bin | 1001000111111111110101… |
… | …1110010100110000001010 |
3 | 1022112010221002211222121122 |
4 | 2101333331132110300022 |
5 | 2303340041303034010 |
6 | 33201032551435242 |
7 | 2053601060163056 |
oct | 221777536246012 |
9 | 38463832758548 |
10 | 10033001221130 |
11 | 3218a766a1998 |
12 | 1160567985b22 |
13 | 57a1532418c4 |
14 | 269857dbac66 |
15 | 125eac2a2855 |
hex | 91ffd794c0a |
10033001221130 has 8 divisors (see below), whose sum is σ = 18059402198052. Its totient is φ = 4013200488448.
The previous prime is 10033001221109. The next prime is 10033001221193. The reversal of 10033001221130 is 3112210033001.
It can be written as a sum of positive squares in 2 ways, for example, as 9928025869129 + 104975352001 = 3150877^2 + 323999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×100330012211302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10033001221099 and 10033001221108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501650061047 + ... + 501650061066.
Almost surely, 210033001221130 is an apocalyptic number.
10033001221130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10033001221130 is a deficient number, since it is larger than the sum of its proper divisors (8026400976922).
10033001221130 is a wasteful number, since it uses less digits than its factorization.
10033001221130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1003300122120.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10033001221130 its reverse (3112210033001), we get a palindrome (13145211254131).
The spelling of 10033001221130 in words is "ten trillion, thirty-three billion, one million, two hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •