Base | Representation |
---|---|
bin | 10000010100010010101… |
… | …100111011000010011101 |
3 | 10222012021100012120122022 |
4 | 100110102230323002131 |
5 | 121332410324332201 |
6 | 2215041311225525 |
7 | 144003602461226 |
oct | 20242254730235 |
9 | 3865240176568 |
10 | 1121300230301 |
11 | 3a25a4825309 |
12 | 1613952182a5 |
13 | 8197996b944 |
14 | 3c3b233024d |
15 | 1e27a95541b |
hex | 10512b3b09d |
1121300230301 has 8 divisors (see below), whose sum is σ = 1157483428608. Its totient is φ = 1085117796000.
The previous prime is 1121300230289. The next prime is 1121300230373. The reversal of 1121300230301 is 1030320031211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1121300230301 - 210 = 1121300229277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121300230301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121300232301) 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, 5275241 + ... + 5483681.
It is an arithmetic number, because the mean of its divisors is an integer number (144685428576).
Almost surely, 21121300230301 is an apocalyptic number.
It is an amenable number.
1121300230301 is a deficient number, since it is larger than the sum of its proper divisors (36183198307).
1121300230301 is a wasteful number, since it uses less digits than its factorization.
1121300230301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 382003.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1121300230301 its reverse (1030320031211), we get a palindrome (2151620261512).
The spelling of 1121300230301 in words is "one trillion, one hundred twenty-one billion, three hundred million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •