Base | Representation |
---|---|
bin | 1001001101101010011001… |
… | …0100010011000111101111 |
3 | 1022212110010122100221002021 |
4 | 2103122212110103013233 |
5 | 2311433400221114043 |
6 | 33313450052011011 |
7 | 2063614565432653 |
oct | 223324624230757 |
9 | 38773118327067 |
10 | 10130323223023 |
11 | 32562783a9413 |
12 | 11773a8900a67 |
13 | 586392c9c283 |
14 | 27044b4d4a63 |
15 | 1287a63513ed |
hex | 936a65131ef |
10130323223023 has 4 divisors (see below), whose sum is σ = 10194847574920. Its totient is φ = 10065798871128.
The previous prime is 10130323222939. The next prime is 10130323223047. The reversal of 10130323223023 is 32032232303101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10130323223023 - 225 = 10130289668591 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130323223623) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 32262175713 + ... + 32262176026.
It is an arithmetic number, because the mean of its divisors is an integer number (2548711893730).
Almost surely, 210130323223023 is an apocalyptic number.
10130323223023 is a deficient number, since it is larger than the sum of its proper divisors (64524351897).
10130323223023 is an equidigital number, since it uses as much as digits as its factorization.
10130323223023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64524351896.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 10130323223023 its reverse (32032232303101), we get a palindrome (42162555526124).
The spelling of 10130323223023 in words is "ten trillion, one hundred thirty billion, three hundred twenty-three million, two hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •