Base | Representation |
---|---|
bin | 1001001001011100000110… |
… | …10100011110100100000010 |
3 | 2122020000201020000011111120 |
4 | 10210232003110132210002 |
5 | 10114033103431434110 |
6 | 110440541010453110 |
7 | 4144204465413402 |
oct | 444560324364402 |
9 | 78200636004446 |
10 | 20115535030530 |
11 | 6455a50128545 |
12 | 230a637b94196 |
13 | b2bb6b43b224 |
14 | 4d78505b6802 |
15 | 24d3b7d6c870 |
hex | 124b8351e902 |
20115535030530 has 16 divisors (see below), whose sum is σ = 48277284073344. Its totient is φ = 5364142674800.
The previous prime is 20115535030523. The next prime is 20115535030531. The reversal of 20115535030530 is 3503053551102.
It is a happy number.
It is a super-3 number, since 3×201155350305303 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20115535030491 and 20115535030500.
It is not an unprimeable number, because it can be changed into a prime (20115535030531) 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, 335258917146 + ... + 335258917205.
It is an arithmetic number, because the mean of its divisors is an integer number (3017330254584).
Almost surely, 220115535030530 is an apocalyptic number.
20115535030530 is an abundant number, since it is smaller than the sum of its proper divisors (28161749042814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20115535030530 is a wasteful number, since it uses less digits than its factorization.
20115535030530 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 670517834361.
The product of its (nonzero) digits is 33750, while the sum is 33.
Adding to 20115535030530 its reverse (3503053551102), we get a palindrome (23618588581632).
The spelling of 20115535030530 in words is "twenty trillion, one hundred fifteen billion, five hundred thirty-five million, thirty thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •