Base | Representation |
---|---|
bin | 10001011110100011000… |
… | …001101011110001011111 |
3 | 11020211001220201111112022 |
4 | 101132203001223301133 |
5 | 124134202414100411 |
6 | 2315425050330355 |
7 | 152525445041243 |
oct | 21364301536137 |
9 | 4224056644468 |
10 | 1201031003231 |
11 | 423399766084 |
12 | 174926a299bb |
13 | 8934508b6a7 |
14 | 421b7426423 |
15 | 21395492edb |
hex | 117a306bc5f |
1201031003231 has 8 divisors (see below), whose sum is σ = 1284026294304. Its totient is φ = 1119407535360.
The previous prime is 1201031003219. The next prime is 1201031003239. The reversal of 1201031003231 is 1323001301021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1201031003231 - 210 = 1201031002207 is a prime.
It is a super-2 number, since 2×12010310032312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201031003239) 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, 342953990 + ... + 342957491.
It is an arithmetic number, because the mean of its divisors is an integer number (160503286788).
Almost surely, 21201031003231 is an apocalyptic number.
1201031003231 is a deficient number, since it is larger than the sum of its proper divisors (82995291073).
1201031003231 is a wasteful number, since it uses less digits than its factorization.
1201031003231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 685911601.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1201031003231 its reverse (1323001301021), we get a palindrome (2524032304252).
The spelling of 1201031003231 in words is "one trillion, two hundred one billion, thirty-one million, three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •