Base | Representation |
---|---|
bin | 11101111110101111001… |
… | …01011100010100011001 |
3 | 10122110220102102020022210 |
4 | 32333113211130110121 |
5 | 113334133202204010 |
6 | 2105121120105333 |
7 | 134265121245300 |
oct | 16772745342431 |
9 | 3573812366283 |
10 | 1030114100505 |
11 | 367961611366 |
12 | 147787165249 |
13 | 761a71a0519 |
14 | 37c01ab3437 |
15 | 1bbe03ccb20 |
hex | efd795c519 |
1030114100505 has 48 divisors (see below), whose sum is σ = 1919941159680. Its totient is φ = 470254111488.
The previous prime is 1030114100471. The next prime is 1030114100527. The reversal of 1030114100505 is 5050014110301.
It is a happy number.
It is not a de Polignac number, because 1030114100505 - 212 = 1030114096409 is a prime.
It is a super-2 number, since 2×10301141005052 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 446164 + ... + 1503093.
It is an arithmetic number, because the mean of its divisors is an integer number (39998774160).
Almost surely, 21030114100505 is an apocalyptic number.
1030114100505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1030114100505 is a deficient number, since it is larger than the sum of its proper divisors (889827059175).
1030114100505 is a wasteful number, since it uses less digits than its factorization.
1030114100505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1949998 (or 1949991 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 1030114100505 its reverse (5050014110301), we get a palindrome (6080128210806).
The spelling of 1030114100505 in words is "one trillion, thirty billion, one hundred fourteen million, one hundred thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •