Base | Representation |
---|---|
bin | 11001001111011011001001… |
… | …00110001100011010000100 |
3 | 21021112021112012222101211112 |
4 | 30213231210212030122010 |
5 | 24233400331311200400 |
6 | 314014521523024152 |
7 | 14456100163216532 |
oct | 1447554446143204 |
9 | 237467465871745 |
10 | 55505550100100 |
11 | 1675a854006431 |
12 | 628542050b058 |
13 | 24c81c673a7b9 |
14 | d9c6a934d152 |
15 | 663c6037d835 |
hex | 327b6498c684 |
55505550100100 has 18 divisors (see below), whose sum is σ = 120447043717434. Its totient is φ = 22202220040000.
The previous prime is 55505550100067. The next prime is 55505550100111. The reversal of 55505550100100 is 100105550555.
It can be written as a sum of positive squares in 3 ways, for example, as 3488221111684 + 52017328988416 = 1867678^2 + 7212304^2 .
It is a super-2 number, since 2×555055501001002 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 277527750401 + ... + 277527750600.
Almost surely, 255505550100100 is an apocalyptic number.
55505550100100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55505550100100 is an abundant number, since it is smaller than the sum of its proper divisors (64941493617334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55505550100100 is a wasteful number, since it uses less digits than its factorization.
55505550100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555055501015 (or 555055501008 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 32.
Adding to 55505550100100 its reverse (100105550555), we get a palindrome (55605655650655).
The spelling of 55505550100100 in words is "fifty-five trillion, five hundred five billion, five hundred fifty million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •