Base | Representation |
---|---|
bin | 11101110000010000011… |
… | …11010000011000011001 |
3 | 10121201211122220000211112 |
4 | 32320020033100120121 |
5 | 113222223122332213 |
6 | 2101353503310105 |
7 | 133601356206014 |
oct | 16701017203031 |
9 | 3551748800745 |
10 | 1022340433433 |
11 | 364632582220 |
12 | 1461778ab335 |
13 | 75538804517 |
14 | 376a54c437b |
15 | 1b8d7bddea8 |
hex | ee083d0619 |
1022340433433 has 16 divisors (see below), whose sum is σ = 1124484379200. Its totient is φ = 921744526080.
The previous prime is 1022340433421. The next prime is 1022340433519. The reversal of 1022340433433 is 3343340432201.
It is a cyclic number.
It is not a de Polignac number, because 1022340433433 - 24 = 1022340433417 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1022340433433.
It is not an unprimeable number, because it can be changed into a prime (1022340436433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1106333 + ... + 1807941.
It is an arithmetic number, because the mean of its divisors is an integer number (70280273700).
Almost surely, 21022340433433 is an apocalyptic number.
It is an amenable number.
1022340433433 is a deficient number, since it is larger than the sum of its proper divisors (102143945767).
1022340433433 is a wasteful number, since it uses less digits than its factorization.
1022340433433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702712.
The product of its (nonzero) digits is 62208, while the sum is 32.
Adding to 1022340433433 its reverse (3343340432201), we get a palindrome (4365680865634).
The spelling of 1022340433433 in words is "one trillion, twenty-two billion, three hundred forty million, four hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •