Base | Representation |
---|---|
bin | 11101000110101011111… |
… | …10110001001110011001 |
3 | 10112121020021121012000211 |
4 | 32203111332301032121 |
5 | 112341021214223413 |
6 | 2043223130531121 |
7 | 132151326161443 |
oct | 16432576611631 |
9 | 3477207535024 |
10 | 1000022414233 |
11 | 35611a645057 |
12 | 141989596aa1 |
13 | 733bcb15abb |
14 | 365893dd493 |
15 | 1b02d6e283d |
hex | e8d5fb1399 |
1000022414233 has 4 divisors (see below), whose sum is σ = 1000282366720. Its totient is φ = 999762461748.
The previous prime is 1000022414227. The next prime is 1000022414263. The reversal of 1000022414233 is 3324142200001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000022414233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000022414203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129970473 + ... + 129978166.
It is an arithmetic number, because the mean of its divisors is an integer number (250070591680).
Almost surely, 21000022414233 is an apocalyptic number.
It is an amenable number.
1000022414233 is a deficient number, since it is larger than the sum of its proper divisors (259952487).
1000022414233 is an equidigital number, since it uses as much as digits as its factorization.
1000022414233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259952486.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 1000022414233 its reverse (3324142200001), we get a palindrome (4324164614234).
The spelling of 1000022414233 in words is "one trillion, twenty-two million, four hundred fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •