Base | Representation |
---|---|
bin | 11101111110101111000… |
… | …10000101111000111011 |
3 | 10122110220100202121112002 |
4 | 32333113202011320323 |
5 | 113334132441102303 |
6 | 2105121045211215 |
7 | 134265110626532 |
oct | 16772742057073 |
9 | 3573810677462 |
10 | 1030113222203 |
11 | 36796107149a |
12 | 147786a00b0b |
13 | 761a6c53810 |
14 | 37c01925319 |
15 | 1bbe02a7788 |
hex | efd7885e3b |
1030113222203 has 8 divisors (see below), whose sum is σ = 1109628646896. Its totient is φ = 950637218400.
The previous prime is 1030113222199. The next prime is 1030113222253. The reversal of 1030113222203 is 3022223110301.
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 1030113222203 - 22 = 1030113222199 is a prime.
It is a super-2 number, since 2×10301132222032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030113222253) 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, 9800933 + ... + 9905478.
It is an arithmetic number, because the mean of its divisors is an integer number (138703580862).
Almost surely, 21030113222203 is an apocalyptic number.
1030113222203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1030113222203 is a deficient number, since it is larger than the sum of its proper divisors (79515424693).
1030113222203 is a wasteful number, since it uses less digits than its factorization.
1030113222203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19710445.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1030113222203 its reverse (3022223110301), we get a palindrome (4052336332504).
The spelling of 1030113222203 in words is "one trillion, thirty billion, one hundred thirteen million, two hundred twenty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •