Base | Representation |
---|---|
bin | 10001111010100011011… |
… | …010100111101110001110 |
3 | 11100200200122012020012101 |
4 | 101322203122213232032 |
5 | 130132244142430220 |
6 | 2341321031025314 |
7 | 154641601662334 |
oct | 21724332475616 |
9 | 4320618166171 |
10 | 1231102311310 |
11 | 435120183a03 |
12 | 17a71980b23a |
13 | 8c12815c801 |
14 | 4382b113b54 |
15 | 220554a530a |
hex | 11ea36a7b8e |
1231102311310 has 24 divisors (see below), whose sum is σ = 2338753372776. Its totient is φ = 466522979760.
The previous prime is 1231102311293. The next prime is 1231102311343. The reversal of 1231102311310 is 131132011321.
It is a super-2 number, since 2×12311023113102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 170509176 + ... + 170516395.
It is an arithmetic number, because the mean of its divisors is an integer number (97448057199).
Almost surely, 21231102311310 is an apocalyptic number.
1231102311310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1231102311310 is a deficient number, since it is larger than the sum of its proper divisors (1107651061466).
1231102311310 is a wasteful number, since it uses less digits than its factorization.
1231102311310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341025616 (or 341025597 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1231102311310 its reverse (131132011321), we get a palindrome (1362234322631).
The spelling of 1231102311310 in words is "one trillion, two hundred thirty-one billion, one hundred two million, three hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •