Base | Representation |
---|---|
bin | 10000010100001000001… |
… | …001100110110101000011 |
3 | 10222011211000002112011110 |
4 | 100110020021212311003 |
5 | 121332030014402243 |
6 | 2215011545014403 |
7 | 143666322652650 |
oct | 20241011466503 |
9 | 3864730075143 |
10 | 1121123200323 |
11 | 3a2513901045 |
12 | 161345a84403 |
13 | 8194c097889 |
14 | 3c396a0ac27 |
15 | 1e26a136e33 |
hex | 10508266d43 |
1121123200323 has 16 divisors (see below), whose sum is σ = 1708542291456. Its totient is φ = 640580298240.
The previous prime is 1121123200279. The next prime is 1121123200349. The reversal of 1121123200323 is 3230023211211.
It is not a de Polignac number, because 1121123200323 - 233 = 1112533265731 is a prime.
It is a super-3 number, since 3×11211232003233 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1121123200323.
It is not an unprimeable number, because it can be changed into a prime (1121123200723) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2339463 + ... + 2777648.
It is an arithmetic number, because the mean of its divisors is an integer number (106783893216).
Almost surely, 21121123200323 is an apocalyptic number.
1121123200323 is a deficient number, since it is larger than the sum of its proper divisors (587419091133).
1121123200323 is a wasteful number, since it uses less digits than its factorization.
1121123200323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5127554.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1121123200323 its reverse (3230023211211), we get a palindrome (4351146411534).
The spelling of 1121123200323 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-three million, two hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •