Base | Representation |
---|---|
bin | 11101001010100101000… |
… | …10110010111101101011 |
3 | 10112210121220221222212212 |
4 | 32211102202302331223 |
5 | 112404311212431243 |
6 | 2044210342555335 |
7 | 132254163303455 |
oct | 16452242627553 |
9 | 3483556858785 |
10 | 1002112233323 |
11 | 356aa225a073 |
12 | 142271438b4b |
13 | 73663a7a946 |
14 | 36706b992d5 |
15 | 1b101de8318 |
hex | e9528b2f6b |
1002112233323 has 8 divisors (see below), whose sum is σ = 1047371654400. Its totient is φ = 956993589288.
The previous prime is 1002112233307. The next prime is 1002112233329. The reversal of 1002112233323 is 3233322112001.
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 1002112233323 - 24 = 1002112233307 is a prime.
It is a super-2 number, since 2×10021122333232 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1002112233329) 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, 35179703 + ... + 35208176.
It is an arithmetic number, because the mean of its divisors is an integer number (130921456800).
Almost surely, 21002112233323 is an apocalyptic number.
1002112233323 is a deficient number, since it is larger than the sum of its proper divisors (45259421077).
1002112233323 is an equidigital number, since it uses as much as digits as its factorization.
1002112233323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70388521.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1002112233323 its reverse (3233322112001), we get a palindrome (4235434345324).
The spelling of 1002112233323 in words is "one trillion, two billion, one hundred twelve million, two hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •