Base | Representation |
---|---|
bin | 101111000011001110… |
… | …1110100100010111010 |
3 | 100122210122222121001210 |
4 | 1132012131310202322 |
5 | 3123412243242104 |
6 | 114230042223550 |
7 | 10204604430000 |
oct | 1360635644272 |
9 | 318718877053 |
10 | 101040212154 |
11 | 3993a624972 |
12 | 176ba1b4bb6 |
13 | 96b3188bab |
14 | 4c67278a70 |
15 | 2965710989 |
hex | 17867748ba |
101040212154 has 40 divisors (see below), whose sum is σ = 235746501120. Its totient is φ = 28868627928.
The previous prime is 101040212153. The next prime is 101040212159. The reversal of 101040212154 is 451212040101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101040212154.
It is not an unprimeable number, because it can be changed into a prime (101040212153) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3492474 + ... + 3521285.
It is an arithmetic number, because the mean of its divisors is an integer number (5893662528).
Almost surely, 2101040212154 is an apocalyptic number.
101040212154 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
101040212154 is an abundant number, since it is smaller than the sum of its proper divisors (134706288966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101040212154 is an frugal number, since it uses more digits than its factorization.
101040212154 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7013792 (or 7013771 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
Adding to 101040212154 its reverse (451212040101), we get a palindrome (552252252255).
The spelling of 101040212154 in words is "one hundred one billion, forty million, two hundred twelve thousand, one hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •