Base | Representation |
---|---|
bin | 10110111101111010000110… |
… | …101010010101011010011110 |
3 | 111020122120211011220010022112 |
4 | 112331322012222111122132 |
5 | 101214432120312041110 |
6 | 554455541201514022 |
7 | 30163553116231310 |
oct | 2675720652253236 |
9 | 436576734803275 |
10 | 101011300112030 |
11 | 2a204719610530 |
12 | b3b4800042912 |
13 | 444942b575bb9 |
14 | 1ad2d89d2b7b0 |
15 | ba2808107405 |
hex | 5bde86a9569e |
101011300112030 has 64 divisors (see below), whose sum is σ = 226752350952960. Its totient is φ = 31474701110400.
The previous prime is 101011300112027. The next prime is 101011300112069. The reversal of 101011300112030 is 30211003110101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 101011300111996 and 101011300112014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16861985 + ... + 22053324.
It is an arithmetic number, because the mean of its divisors is an integer number (3543005483640).
Almost surely, 2101011300112030 is an apocalyptic number.
101011300112030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101011300112030 is an abundant number, since it is smaller than the sum of its proper divisors (125741050840930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011300112030 is a wasteful number, since it uses less digits than its factorization.
101011300112030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38918705.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 101011300112030 its reverse (30211003110101), we get a palindrome (131222303222131).
The spelling of 101011300112030 in words is "one hundred one trillion, eleven billion, three hundred million, one hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •