Base | Representation |
---|---|
bin | 10111000010111001010111… |
… | …011011101110000101010101 |
3 | 111021212100122212000122022020 |
4 | 113002321113123232011111 |
5 | 101241041201403313240 |
6 | 555321233315123353 |
7 | 30230410131654411 |
oct | 2702712733560525 |
9 | 437770585018266 |
10 | 101354105135445 |
11 | 2a327042064438 |
12 | b44b1308a3559 |
13 | 4472860622916 |
14 | 1b057c9dabd41 |
15 | bab6bd67b0d0 |
hex | 5c2e576ee155 |
101354105135445 has 16 divisors (see below), whose sum is σ = 162168238707072. Its totient is φ = 54054965908800.
The previous prime is 101354105135401. The next prime is 101354105135467. The reversal of 101354105135445 is 544531501453101.
It is not a de Polignac number, because 101354105135445 - 28 = 101354105135189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101354105135397 and 101354105135406.
It is a congruent number.
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, 33295081 + ... + 36211470.
It is an arithmetic number, because the mean of its divisors is an integer number (10135514919192).
Almost surely, 2101354105135445 is an apocalyptic number.
101354105135445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101354105135445 is a deficient number, since it is larger than the sum of its proper divisors (60814133571627).
101354105135445 is an equidigital number, since it uses as much as digits as its factorization.
101354105135445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69603772.
The product of its (nonzero) digits is 360000, while the sum is 42.
Adding to 101354105135445 its reverse (544531501453101), we get a palindrome (645885606588546).
The spelling of 101354105135445 in words is "one hundred one trillion, three hundred fifty-four billion, one hundred five million, one hundred thirty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •