Base | Representation |
---|---|
bin | 10110111111011111010111… |
… | …101010101001011110111010 |
3 | 111021000222110222121221222111 |
4 | 112333133113222221132322 |
5 | 101223222312013044010 |
6 | 555021522500042534 |
7 | 30204452456315062 |
oct | 2677372752513672 |
9 | 437028428557874 |
10 | 101120033331130 |
11 | 2a246846692380 |
12 | b4118a669344a |
13 | 44567694990b8 |
14 | 1ad8342b9a3a2 |
15 | ba556ddc258a |
hex | 5bf7d7aa97ba |
101120033331130 has 32 divisors (see below), whose sum is σ = 207196147352448. Its totient is φ = 35172185505600.
The previous prime is 101120033331101. The next prime is 101120033331193. The reversal of 101120033331130 is 31133330021101.
It is a super-2 number, since 2×1011200333311302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19984193781 + ... + 19984198840.
It is an arithmetic number, because the mean of its divisors is an integer number (6474879604764).
Almost surely, 2101120033331130 is an apocalyptic number.
101120033331130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101120033331130 is an abundant number, since it is smaller than the sum of its proper divisors (106076114021318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120033331130 is a wasteful number, since it uses less digits than its factorization.
101120033331130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39968392662.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 101120033331130 its reverse (31133330021101), we get a palindrome (132253363352231).
The spelling of 101120033331130 in words is "one hundred one trillion, one hundred twenty billion, thirty-three million, three hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •