Base | Representation |
---|---|
bin | 11001000010101000101001… |
… | …010010001000111010110101 |
3 | 112102221112120110000022100102 |
4 | 121002220221102020322311 |
5 | 103413401313432300023 |
6 | 1030122015432123445 |
7 | 32124535450264100 |
oct | 3102505122107265 |
9 | 472845513008312 |
10 | 110132244025013 |
11 | 32100905679551 |
12 | 10428449836585 |
13 | 495b570050232 |
14 | 1d2a601467737 |
15 | caebd458c628 |
hex | 642a29488eb5 |
110132244025013 has 48 divisors (see below), whose sum is σ = 140051752372224. Its totient is φ = 85996683279360.
The previous prime is 110132244025009. The next prime is 110132244025019. The reversal of 110132244025013 is 310520442231011.
It is a happy number.
It is not a de Polignac number, because 110132244025013 - 22 = 110132244025009 is a prime.
It is a super-2 number, since 2×1101322440250132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110132244025019) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8358131 + ... + 17032992.
It is an arithmetic number, because the mean of its divisors is an integer number (2917744841088).
Almost surely, 2110132244025013 is an apocalyptic number.
It is an amenable number.
110132244025013 is a deficient number, since it is larger than the sum of its proper divisors (29919508347211).
110132244025013 is a wasteful number, since it uses less digits than its factorization.
110132244025013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25391322 (or 25391315 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 110132244025013 its reverse (310520442231011), we get a palindrome (420652686256024).
The spelling of 110132244025013 in words is "one hundred ten trillion, one hundred thirty-two billion, two hundred forty-four million, twenty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •