Base | Representation |
---|---|
bin | 10001111010101111110… |
… | …011010010000111111000 |
3 | 11100201020010012010212002 |
4 | 101322233303102013320 |
5 | 130133210341244112 |
6 | 2341353412440132 |
7 | 154650004121162 |
oct | 21725763220770 |
9 | 4321203163762 |
10 | 1231310103032 |
11 | 4352174a89a9 |
12 | 17a777319048 |
13 | 8c15c2144a9 |
14 | 4384a963932 |
15 | 2206884d1c2 |
hex | 11eafcd21f8 |
1231310103032 has 32 divisors (see below), whose sum is σ = 2327101872480. Its totient is φ = 610769034240.
The previous prime is 1231310103031. The next prime is 1231310103073. The reversal of 1231310103032 is 2303010131321.
It is a super-2 number, since 2×12313101030322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1231310102995 and 1231310103013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1231310103031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 707093 + ... + 1721220.
It is an arithmetic number, because the mean of its divisors is an integer number (72721933515).
Almost surely, 21231310103032 is an apocalyptic number.
It is an amenable number.
1231310103032 is a deficient number, since it is larger than the sum of its proper divisors (1095791769448).
1231310103032 is a wasteful number, since it uses less digits than its factorization.
1231310103032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2428823 (or 2428819 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1231310103032 its reverse (2303010131321), we get a palindrome (3534320234353).
The spelling of 1231310103032 in words is "one trillion, two hundred thirty-one billion, three hundred ten million, one hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •