Base | Representation |
---|---|
bin | 10111000010010101001111… |
… | …111010101111101010101000 |
3 | 111021201122120011010100220012 |
4 | 113002111033322233222220 |
5 | 101234422241013020000 |
6 | 555251341212151052 |
7 | 30224535120456413 |
oct | 2702251772575250 |
9 | 437648504110805 |
10 | 101315324345000 |
11 | 2a3116513425a7 |
12 | b443709168488 |
13 | 446bcc002c23c |
14 | 1b0398b6d0b7a |
15 | baa69dc26735 |
hex | 5c254feafaa8 |
101315324345000 has 40 divisors (see below), whose sum is σ = 237381804952050. Its totient is φ = 40526129736000.
The previous prime is 101315324344981. The next prime is 101315324345023. The reversal of 101315324345000 is 543423513101.
It can be written as a sum of positive squares in 5 ways, for example, as 4251489343396 + 97063835001604 = 2061914^2 + 9852098^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10131527435 + ... + 10131537434.
Almost surely, 2101315324345000 is an apocalyptic number.
101315324345000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101315324345000 is an abundant number, since it is smaller than the sum of its proper divisors (136066480607050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101315324345000 is an equidigital number, since it uses as much as digits as its factorization.
101315324345000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20263064895 (or 20263064876 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 101315324345000 its reverse (543423513101), we get a palindrome (101858747858101).
The spelling of 101315324345000 in words is "one hundred one trillion, three hundred fifteen billion, three hundred twenty-four million, three hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •