Base | Representation |
---|---|
bin | 1000001001100101000… |
… | …0010011000111000100 |
3 | 111101101112210001100110 |
4 | 2002121100103013010 |
5 | 4243220043440400 |
6 | 144153023113020 |
7 | 13054403361165 |
oct | 2023120230704 |
9 | 441345701313 |
10 | 140010140100 |
11 | 5441808a596 |
12 | 23175142770 |
13 | 10283a0255c |
14 | 6ac2b0b76c |
15 | 3996a75e50 |
hex | 20994131c4 |
140010140100 has 72 divisors (see below), whose sum is σ = 405160943040. Its totient is φ = 37330052480.
The previous prime is 140010140099. The next prime is 140010140107. The reversal of 140010140100 is 1041010041.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (140010140107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2026729 + ... + 2094671.
It is an arithmetic number, because the mean of its divisors is an integer number (5627235320).
Almost surely, 2140010140100 is an apocalyptic number.
140010140100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140010140100 is an abundant number, since it is smaller than the sum of its proper divisors (265150802940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140010140100 is a wasteful number, since it uses less digits than its factorization.
140010140100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74829 (or 74822 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 140010140100 its reverse (1041010041), we get a palindrome (141051150141).
The spelling of 140010140100 in words is "one hundred forty billion, ten million, one hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •