Base | Representation |
---|---|
bin | 1001001101101010011001… |
… | …0011100001110111111111 |
3 | 1022212110010121222200101110 |
4 | 2103122212103201313333 |
5 | 2311433400143140221 |
6 | 33313450043413103 |
7 | 2063614563632613 |
oct | 223324623416777 |
9 | 38773117880343 |
10 | 10130323021311 |
11 | 3256278280909 |
12 | 11773a8824193 |
13 | 586392c2b50c |
14 | 27044b481343 |
15 | 1287a6311776 |
hex | 936a64e1dff |
10130323021311 has 4 divisors (see below), whose sum is σ = 13507097361752. Its totient is φ = 6753548680872.
The previous prime is 10130323021277. The next prime is 10130323021327. The reversal of 10130323021311 is 11312032303101.
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 10130323021311 - 223 = 10130314632703 is a prime.
It is a super-2 number, since 2×101303230213112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130323026311) 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, 1688387170216 + ... + 1688387170221.
It is an arithmetic number, because the mean of its divisors is an integer number (3376774340438).
Almost surely, 210130323021311 is an apocalyptic number.
10130323021311 is a deficient number, since it is larger than the sum of its proper divisors (3376774340441).
10130323021311 is an equidigital number, since it uses as much as digits as its factorization.
10130323021311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3376774340440.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10130323021311 its reverse (11312032303101), we get a palindrome (21442355324412).
The spelling of 10130323021311 in words is "ten trillion, one hundred thirty billion, three hundred twenty-three million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •