Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …11000001100001111100 |
3 | 10122111101101102122112012 |
4 | 32333202223001201330 |
5 | 113340023312104040 |
6 | 2105151403030352 |
7 | 134302540314653 |
oct | 16774253014174 |
9 | 3574341378465 |
10 | 1030300113020 |
11 | 367a47610312 |
12 | 14781950b3b8 |
13 | 7620689acb9 |
14 | 37c1c69419a |
15 | 1bc018c2865 |
hex | efe2ac187c |
1030300113020 has 24 divisors (see below), whose sum is σ = 2200301938800. Its totient is φ = 405134959232.
The previous prime is 1030300113019. The next prime is 1030300113023. The reversal of 1030300113020 is 203110030301.
It is a junction number, because it is equal to n+sod(n) for n = 1030300112986 and 1030300113004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030300113023) 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, 436566665 + ... + 436569024.
It is an arithmetic number, because the mean of its divisors is an integer number (91679247450).
Almost surely, 21030300113020 is an apocalyptic number.
1030300113020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030300113020 is an abundant number, since it is smaller than the sum of its proper divisors (1170001825780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030300113020 is a wasteful number, since it uses less digits than its factorization.
1030300113020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 873135757 (or 873135755 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1030300113020 its reverse (203110030301), we get a palindrome (1233410143321).
The spelling of 1030300113020 in words is "one trillion, thirty billion, three hundred million, one hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •