Base | Representation |
---|---|
bin | 10111000010010001100111… |
… | …110110111001001011111110 |
3 | 111021201021111211011000211111 |
4 | 113002101213312321023332 |
5 | 101234341302320140220 |
6 | 555245455012512234 |
7 | 30224336463662446 |
oct | 2702214766711376 |
9 | 437637454130744 |
10 | 101311431021310 |
11 | 2a30aa3369a914 |
12 | b442a0131b67a |
13 | 446b81c54b103 |
14 | 1b036dc5c9126 |
15 | baa52202415a |
hex | 5c2467db92fe |
101311431021310 has 32 divisors (see below), whose sum is σ = 193938275077920. Its totient is φ = 37972752986112.
The previous prime is 101311431021301. The next prime is 101311431021341. The reversal of 101311431021310 is 13120134113101.
It is a super-2 number, since 2×1013114310213102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1312625715 + ... + 1312702894.
It is an arithmetic number, because the mean of its divisors is an integer number (6060571096185).
Almost surely, 2101311431021310 is an apocalyptic number.
101311431021310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101311431021310 is a deficient number, since it is larger than the sum of its proper divisors (92626844056610).
101311431021310 is a wasteful number, since it uses less digits than its factorization.
101311431021310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2625328860.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 101311431021310 its reverse (13120134113101), we get a palindrome (114431565134411).
The spelling of 101311431021310 in words is "one hundred one trillion, three hundred eleven billion, four hundred thirty-one million, twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •