Base | Representation |
---|---|
bin | 11101000111000011111… |
… | …01001010110000000110 |
3 | 10112121202021122022102200 |
4 | 32203201331022300012 |
5 | 112341424132233334 |
6 | 2043255105015330 |
7 | 132156315643644 |
oct | 16434175126006 |
9 | 3477667568380 |
10 | 1000223321094 |
11 | 356212a97388 |
12 | 141a24924546 |
13 | 73422629aba |
14 | 365a7d7a194 |
15 | 1b04117a799 |
hex | e8e1f4ac06 |
1000223321094 has 24 divisors (see below), whose sum is σ = 2169277311240. Its totient is φ = 333080576448.
The previous prime is 1000223321093. The next prime is 1000223321143. The reversal of 1000223321094 is 4901233220001.
It is a happy number.
It is a super-2 number, since 2×10002233210942 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000223321093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27247587 + ... + 27284270.
It is an arithmetic number, because the mean of its divisors is an integer number (90386554635).
Almost surely, 21000223321094 is an apocalyptic number.
1000223321094 is an abundant number, since it is smaller than the sum of its proper divisors (1169053990146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000223321094 is a wasteful number, since it uses less digits than its factorization.
1000223321094 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54532884 (or 54532881 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 1000223321094 its reverse (4901233220001), we get a palindrome (5901456541095).
The spelling of 1000223321094 in words is "one trillion, two hundred twenty-three million, three hundred twenty-one thousand, ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •