Base | Representation |
---|---|
bin | 110100100111101110… |
… | …0011011101001001111 |
3 | 101210200022012112100020 |
4 | 1221033130123221033 |
5 | 3322412003044043 |
6 | 123525025033223 |
7 | 11110203114600 |
oct | 1511734335117 |
9 | 353608175306 |
10 | 113002003023 |
11 | 43a18759448 |
12 | 19a98185813 |
13 | a86b433060 |
14 | 567db8bda7 |
15 | 2e15934e83 |
hex | 1a4f71ba4f |
113002003023 has 48 divisors (see below), whose sum is σ = 188926780896. Its totient is φ = 59549817600.
The previous prime is 113002003021. The next prime is 113002003027. The reversal of 113002003023 is 320300200311.
It is not a de Polignac number, because 113002003023 - 21 = 113002003021 is a prime.
It is a super-2 number, since 2×1130020030232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113002002993 and 113002003011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113002003021) 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, 2061673 + ... + 2115773.
It is an arithmetic number, because the mean of its divisors is an integer number (3935974602).
Almost surely, 2113002003023 is an apocalyptic number.
113002003023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
113002003023 is a deficient number, since it is larger than the sum of its proper divisors (75924777873).
113002003023 is a wasteful number, since it uses less digits than its factorization.
113002003023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55224 (or 55217 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 113002003023 its reverse (320300200311), we get a palindrome (433302203334).
The spelling of 113002003023 in words is "one hundred thirteen billion, two million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •