Base | Representation |
---|---|
bin | 10000010100000010100… |
… | …110111010100011110111 |
3 | 10222011120112010122011122 |
4 | 100110002212322203313 |
5 | 121331332214020043 |
6 | 2214554424054155 |
7 | 143664113435240 |
oct | 20240246724367 |
9 | 3864515118148 |
10 | 1121030220023 |
11 | 3a247637461a |
12 | 16131a90435b |
13 | 81935a4124c |
14 | 3c388525cc7 |
15 | 1e261dbc368 |
hex | 105029ba8f7 |
1121030220023 has 32 divisors (see below), whose sum is σ = 1385940492288. Its totient is φ = 884775628800.
The previous prime is 1121030220017. The next prime is 1121030220047. The reversal of 1121030220023 is 3200220301211.
It is not a de Polignac number, because 1121030220023 - 28 = 1121030219767 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121030219983 and 1121030220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121030220083) 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 31 ways as a sum of consecutive naturals, for example, 14901383 + ... + 14976423.
It is an arithmetic number, because the mean of its divisors is an integer number (43310640384).
Almost surely, 21121030220023 is an apocalyptic number.
1121030220023 is a deficient number, since it is larger than the sum of its proper divisors (264910272265).
1121030220023 is a wasteful number, since it uses less digits than its factorization.
1121030220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77783.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1121030220023 its reverse (3200220301211), we get a palindrome (4321250521234).
The spelling of 1121030220023 in words is "one trillion, one hundred twenty-one billion, thirty million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •