Base | Representation |
---|---|
bin | 1001001100101001111010… |
… | …0011100010101110111111 |
3 | 1022210210110021101012120012 |
4 | 2103022132203202232333 |
5 | 2311142422330212343 |
6 | 33301504252413435 |
7 | 2062432615203641 |
oct | 223123643425677 |
9 | 38723407335505 |
10 | 10113013132223 |
11 | 32499a52a3a51 |
12 | 1173b7777727b |
13 | 5848649870b1 |
14 | 26d688576891 |
15 | 1280e1825718 |
hex | 9329e8e2bbf |
10113013132223 has 8 divisors (see below), whose sum is σ = 10153772931456. Its totient is φ = 10072257055000.
The previous prime is 10113013132217. The next prime is 10113013132231. The reversal of 10113013132223 is 32223131031101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10113013132223 - 24 = 10113013132207 is a prime.
It is a super-2 number, since 2×101130131322232 (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 (10113013134223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4580240 + ... + 6419082.
It is an arithmetic number, because the mean of its divisors is an integer number (1269221616432).
Almost surely, 210113013132223 is an apocalyptic number.
10113013132223 is a deficient number, since it is larger than the sum of its proper divisors (40759799233).
10113013132223 is a wasteful number, since it uses less digits than its factorization.
10113013132223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1861005.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10113013132223 its reverse (32223131031101), we get a palindrome (42336144163324).
The spelling of 10113013132223 in words is "ten trillion, one hundred thirteen billion, thirteen million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •