Base | Representation |
---|---|
bin | 1001000111111111110101… |
… | …1110010100111111100001 |
3 | 1022112010221002212000222001 |
4 | 2101333331132110333201 |
5 | 2303340041303101423 |
6 | 33201032551444001 |
7 | 2053601060165662 |
oct | 221777536247741 |
9 | 38463832760861 |
10 | 10033001222113 |
11 | 3218a766a2701 |
12 | 1160567986601 |
13 | 57a15324219c |
14 | 269857dbb369 |
15 | 125eac2a2cad |
hex | 91ffd794fe1 |
10033001222113 has 8 divisors (see below), whose sum is σ = 10053601603200. Its totient is φ = 10012401519120.
The previous prime is 10033001222093. The next prime is 10033001222147. The reversal of 10033001222113 is 31122210033001.
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 10033001222113 - 217 = 10033001091041 is a prime.
It is a super-2 number, since 2×100330012221132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10033001222183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38466063 + ... + 38726011.
It is an arithmetic number, because the mean of its divisors is an integer number (1256700200400).
Almost surely, 210033001222113 is an apocalyptic number.
It is an amenable number.
10033001222113 is a deficient number, since it is larger than the sum of its proper divisors (20600381087).
10033001222113 is an equidigital number, since it uses as much as digits as its factorization.
10033001222113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339047.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10033001222113 its reverse (31122210033001), we get a palindrome (41155211255114).
The spelling of 10033001222113 in words is "ten trillion, thirty-three billion, one million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •