Base | Representation |
---|---|
bin | 11101001010101010000… |
… | …11110011111011000001 |
3 | 10112210201212101102220020 |
4 | 32211111003303323001 |
5 | 112404403014124213 |
6 | 2044214451404053 |
7 | 132255215132214 |
oct | 16452503637301 |
9 | 3483655342806 |
10 | 1002154442433 |
11 | 357014069431 |
12 | 1422835b3629 |
13 | 7366c738b51 |
14 | 3670c62577b |
15 | 1b105984923 |
hex | e9550f3ec1 |
1002154442433 has 8 divisors (see below), whose sum is σ = 1336220620896. Its totient is φ = 668095612800.
The previous prime is 1002154442353. The next prime is 1002154442441. The reversal of 1002154442433 is 3342444512001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1002154442433 - 29 = 1002154441921 is a prime.
It is a super-2 number, since 2×10021544424332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002154442394 and 1002154442403.
It is not an unprimeable number, because it can be changed into a prime (1002154442453) 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, 1510723 + ... + 2070408.
It is an arithmetic number, because the mean of its divisors is an integer number (167027577612).
Almost surely, 21002154442433 is an apocalyptic number.
It is an amenable number.
1002154442433 is a deficient number, since it is larger than the sum of its proper divisors (334066178463).
1002154442433 is an equidigital number, since it uses as much as digits as its factorization.
1002154442433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3674415.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 1002154442433 its reverse (3342444512001), we get a palindrome (4344598954434).
The spelling of 1002154442433 in words is "one trillion, two billion, one hundred fifty-four million, four hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •