Base | Representation |
---|---|
bin | 11101111110101111000… |
… | …10000111110111011101 |
3 | 10122110220100210000122000 |
4 | 32333113202013313131 |
5 | 113334132441332201 |
6 | 2105121045312513 |
7 | 134265110662251 |
oct | 16772742076735 |
9 | 3573810700560 |
10 | 1030113230301 |
11 | 367961077591 |
12 | 147786a05739 |
13 | 761a6c573cc |
14 | 37c01928261 |
15 | 1bbe02a9d86 |
hex | efd7887ddd |
1030113230301 has 16 divisors (see below), whose sum is σ = 1526112360000. Its totient is φ = 686733745104.
The previous prime is 1030113230299. The next prime is 1030113230383. The reversal of 1030113230301 is 1030323110301.
It is a happy number.
1030113230301 is a `hidden beast` number, since 1 + 0 + 30 + 11 + 323 + 0 + 301 = 666.
It is not a de Polignac number, because 1030113230301 - 21 = 1030113230299 is a prime.
It is a super-2 number, since 2×10301132303012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030113230101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2667655 + ... + 3029291.
It is an arithmetic number, because the mean of its divisors is an integer number (95382022500).
Almost surely, 21030113230301 is an apocalyptic number.
It is an amenable number.
1030113230301 is a deficient number, since it is larger than the sum of its proper divisors (495999129699).
1030113230301 is a wasteful number, since it uses less digits than its factorization.
1030113230301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467145 (or 467139 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1030113230301 its reverse (1030323110301), we get a palindrome (2060436340602).
The spelling of 1030113230301 in words is "one trillion, thirty billion, one hundred thirteen million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •