Base | Representation |
---|---|
bin | 111100100101011010… |
… | …0111100010100001000 |
3 | 110102211012101220010201 |
4 | 1321022310330110020 |
5 | 4112423212131100 |
6 | 135434045021544 |
7 | 12254052151525 |
oct | 1711264742410 |
9 | 412735356121 |
10 | 130104411400 |
11 | 501a4603a47 |
12 | 2126b8548b4 |
13 | c365701222 |
14 | 64232c814c |
15 | 35b70da36a |
hex | 1e4ad3c508 |
130104411400 has 48 divisors (see below), whose sum is σ = 318413437200. Its totient is φ = 49302722880.
The previous prime is 130104411379. The next prime is 130104411401. The reversal of 130104411400 is 4114401031.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (130104411401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17115202 + ... + 17122801.
It is an arithmetic number, because the mean of its divisors is an integer number (6633613275).
Almost surely, 2130104411400 is an apocalyptic number.
130104411400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130104411400 is an abundant number, since it is smaller than the sum of its proper divisors (188309025800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130104411400 is a wasteful number, since it uses less digits than its factorization.
130104411400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34238038 (or 34238029 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 130104411400 its reverse (4114401031), we get a palindrome (134218812431).
The spelling of 130104411400 in words is "one hundred thirty billion, one hundred four million, four hundred eleven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •