Base | Representation |
---|---|
bin | 11101011110111001100… |
… | …00100011111100011111 |
3 | 10120211210011210101201202 |
4 | 32233130300203330133 |
5 | 113044131341012343 |
6 | 2053213032230115 |
7 | 133121414462054 |
oct | 16573460437437 |
9 | 3524704711652 |
10 | 1013021032223 |
11 | 36068aa66152 |
12 | 1443b683b33b |
13 | 746b1b22735 |
14 | 3705d8c902b |
15 | 1b53e96edb8 |
hex | ebdcc23f1f |
1013021032223 has 8 divisors (see below), whose sum is σ = 1018930982160. Its totient is φ = 1007114523840.
The previous prime is 1013021032217. The next prime is 1013021032241. The reversal of 1013021032223 is 3222301203101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1013021032223 - 218 = 1013020770079 is a prime.
It is a super-2 number, since 2×10130210322232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013021032195 and 1013021032204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013021062223) 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, 268790 + ... + 1448547.
It is an arithmetic number, because the mean of its divisors is an integer number (127366372770).
Almost surely, 21013021032223 is an apocalyptic number.
1013021032223 is a deficient number, since it is larger than the sum of its proper divisors (5909949937).
1013021032223 is a wasteful number, since it uses less digits than its factorization.
1013021032223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1720777.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1013021032223 its reverse (3222301203101), we get a palindrome (4235322235324).
The spelling of 1013021032223 in words is "one trillion, thirteen billion, twenty-one million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •