Base | Representation |
---|---|
bin | 10001111010011101011… |
… | …000001010010100100101 |
3 | 11100200102120120020201220 |
4 | 101322131120022110211 |
5 | 130132042224101201 |
6 | 2341303011410553 |
7 | 154636231611606 |
oct | 21723530122445 |
9 | 4320376506656 |
10 | 1231001003301 |
11 | 435078a79783 |
12 | 17a6ab8b3a59 |
13 | 8c11017b844 |
14 | 4381b8a1dad |
15 | 2204b643036 |
hex | 11e9d60a525 |
1231001003301 has 16 divisors (see below), whose sum is σ = 1666204516800. Its totient is φ = 808417976784.
The previous prime is 1231001003293. The next prime is 1231001003303. The reversal of 1231001003301 is 1033001001321.
It is not a de Polignac number, because 1231001003301 - 23 = 1231001003293 is a prime.
It is a super-2 number, since 2×12310010033012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1231001003303) 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 15 ways as a sum of consecutive naturals, for example, 220135 + ... + 1584443.
It is an arithmetic number, because the mean of its divisors is an integer number (104137782300).
Almost surely, 21231001003301 is an apocalyptic number.
It is an amenable number.
1231001003301 is a deficient number, since it is larger than the sum of its proper divisors (435203513499).
1231001003301 is an frugal number, since it uses more digits than its factorization.
1231001003301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1364513 (or 1364379 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1231001003301 its reverse (1033001001321), we get a palindrome (2264002004622).
The spelling of 1231001003301 in words is "one trillion, two hundred thirty-one billion, one million, three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •