Base | Representation |
---|---|
bin | 1001000110110110100010… |
… | …0000011111000001001111 |
3 | 1022110021010122010201101210 |
4 | 2101231220200133001033 |
5 | 2303024240430104403 |
6 | 33144020124105503 |
7 | 2052303312421221 |
oct | 221555040370117 |
9 | 38407118121353 |
10 | 10013322113103 |
11 | 3210698316851 |
12 | 1158795395293 |
13 | 57833819b19a |
14 | 26890c586411 |
15 | 1257097c0b03 |
hex | 91b6881f04f |
10013322113103 has 4 divisors (see below), whose sum is σ = 13351096150808. Its totient is φ = 6675548075400.
The previous prime is 10013322113101. The next prime is 10013322113107. The reversal of 10013322113103 is 30131122331001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10013322113103 - 21 = 10013322113101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10013322113103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10013322113101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1668887018848 + ... + 1668887018853.
It is an arithmetic number, because the mean of its divisors is an integer number (3337774037702).
Almost surely, 210013322113103 is an apocalyptic number.
10013322113103 is a deficient number, since it is larger than the sum of its proper divisors (3337774037705).
10013322113103 is an equidigital number, since it uses as much as digits as its factorization.
10013322113103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3337774037704.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10013322113103 its reverse (30131122331001), we get a palindrome (40144444444104).
The spelling of 10013322113103 in words is "ten trillion, thirteen billion, three hundred twenty-two million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •