Base | Representation |
---|---|
bin | 10110111110001100100011… |
… | …110000001100101000101010 |
3 | 111020201110222011010012202110 |
4 | 112332030203300030220222 |
5 | 101220243211034303114 |
6 | 554513015335143150 |
7 | 30165154140501330 |
oct | 2676144360145052 |
9 | 436643864105673 |
10 | 101031115541034 |
11 | 2a212067935638 |
12 | b3b8610214ab6 |
13 | 444b268939213 |
14 | 1ad3d098c9b50 |
15 | ba30b7a65759 |
hex | 5be323c0ca2a |
101031115541034 has 32 divisors (see below), whose sum is σ = 231208857446400. Its totient is φ = 28830958842672.
The previous prime is 101031115541017. The next prime is 101031115541039. The reversal of 101031115541034 is 430145511130101.
It is a junction number, because it is equal to n+sod(n) for n = 101031115540992 and 101031115541010.
It is not an unprimeable number, because it can be changed into a prime (101031115541039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1461388734 + ... + 1461457865.
It is an arithmetic number, because the mean of its divisors is an integer number (7225276795200).
Almost surely, 2101031115541034 is an apocalyptic number.
101031115541034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
101031115541034 is an abundant number, since it is smaller than the sum of its proper divisors (130177741905366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101031115541034 is a wasteful number, since it uses less digits than its factorization.
101031115541034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2922847434.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 101031115541034 its reverse (430145511130101), we get a palindrome (531176626671135).
The spelling of 101031115541034 in words is "one hundred one trillion, thirty-one billion, one hundred fifteen million, five hundred forty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •