Base | Representation |
---|---|
bin | 10010111011101001101… |
… | …001101001011010000111 |
3 | 11121101002221021102201122 |
4 | 102323221221221122013 |
5 | 132303422013212411 |
6 | 2433400551544155 |
7 | 162664665442652 |
oct | 22735151513207 |
9 | 4541087242648 |
10 | 1301000132231 |
11 | 461829726358 |
12 | 19018638b05b |
13 | 958b737c867 |
14 | 46d7c32c899 |
15 | 23c96b309db |
hex | 12ee9a69687 |
1301000132231 has 8 divisors (see below), whose sum is σ = 1421965989504. Its totient is φ = 1184971656960.
The previous prime is 1301000132213. The next prime is 1301000132251. The reversal of 1301000132231 is 1322310001031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1301000132231 - 214 = 1301000115847 is a prime.
It is a super-2 number, since 2×13010001322312 (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 (1301000132251) 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, 1234344950 + ... + 1234346003.
It is an arithmetic number, because the mean of its divisors is an integer number (177745748688).
Almost surely, 21301000132231 is an apocalyptic number.
1301000132231 is a deficient number, since it is larger than the sum of its proper divisors (120965857273).
1301000132231 is a wasteful number, since it uses less digits than its factorization.
1301000132231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2468691001.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1301000132231 its reverse (1322310001031), we get a palindrome (2623310133262).
The spelling of 1301000132231 in words is "one trillion, three hundred one billion, one hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •