Base | Representation |
---|---|
bin | 110000111010001001… |
… | …0000011011111001100 |
3 | 101001002201200011011020 |
4 | 1201310102003133030 |
5 | 3210100201330121 |
6 | 120130011354140 |
7 | 10405513106523 |
oct | 1416422033714 |
9 | 331081604136 |
10 | 105030105036 |
11 | 405a78354aa |
12 | 18432452950 |
13 | 9b9a97c05c |
14 | 512511b4ba |
15 | 2aeab3b1c6 |
hex | 18744837cc |
105030105036 has 48 divisors (see below), whose sum is σ = 251292402816. Its totient is φ = 34131930624.
The previous prime is 105030105001. The next prime is 105030105043. The reversal of 105030105036 is 630501030501.
It is a super-2 number, since 2×1050301050362 (a number of 23 digits) contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 105030104997 and 105030105015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 595386 + ... + 751361.
It is an arithmetic number, because the mean of its divisors is an integer number (5235258392).
Almost surely, 2105030105036 is an apocalyptic number.
It is an amenable number.
105030105036 is an abundant number, since it is smaller than the sum of its proper divisors (146262297780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105030105036 is a wasteful number, since it uses less digits than its factorization.
105030105036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1346918 (or 1346916 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 24.
Adding to 105030105036 its reverse (630501030501), we get a palindrome (735531135537).
The spelling of 105030105036 in words is "one hundred five billion, thirty million, one hundred five thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •