Base | Representation |
---|---|
bin | 10110101111111111101010… |
… | …111100111110001111100111 |
3 | 111010021011222021021201200122 |
4 | 112233333222330332033213 |
5 | 101103301024440344310 |
6 | 552444420541432155 |
7 | 30034515153044360 |
oct | 2657775274761747 |
9 | 433234867251618 |
10 | 100055205012455 |
11 | 299761a0883110 |
12 | b27b45186b65b |
13 | 43aa21c3651a4 |
14 | 1a9c9aa92cb67 |
15 | b879eb0b5555 |
hex | 5affeaf3e3e7 |
100055205012455 has 32 divisors (see below), whose sum is σ = 149693969507328. Its totient is φ = 62371664409600.
The previous prime is 100055205012449. The next prime is 100055205012457. The reversal of 100055205012455 is 554210502550001.
It is a de Polignac number, because none of the positive numbers 2k-100055205012455 is a prime.
It is a super-2 number, since 2×1000552050124552 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100055205012457) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63934199 + ... + 65480471.
It is an arithmetic number, because the mean of its divisors is an integer number (4677936547104).
Almost surely, 2100055205012455 is an apocalyptic number.
100055205012455 is a deficient number, since it is larger than the sum of its proper divisors (49638764494873).
100055205012455 is a wasteful number, since it uses less digits than its factorization.
100055205012455 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1714367.
The product of its (nonzero) digits is 50000, while the sum is 35.
Adding to 100055205012455 its reverse (554210502550001), we get a palindrome (654265707562456).
The spelling of 100055205012455 in words is "one hundred trillion, fifty-five billion, two hundred five million, twelve thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •