Base | Representation |
---|---|
bin | 10010111010100010… |
… | …11000001100101100 |
3 | 222012200222211100200 |
4 | 21131101120030230 |
5 | 131244110134434 |
6 | 4355351553500 |
7 | 506434063032 |
oct | 113521301454 |
9 | 28180884320 |
10 | 10154771244 |
11 | 4341115a32 |
12 | 1b7498b890 |
13 | c5aa99ca7 |
14 | 6c4930552 |
15 | 3e6781199 |
hex | 25d45832c |
10154771244 has 18 divisors (see below), whose sum is σ = 25669005180. Its totient is φ = 3384923736.
The previous prime is 10154771243. The next prime is 10154771269. The reversal of 10154771244 is 44217745101.
10154771244 is a `hidden beast` number, since 1 + 0 + 1 + 547 + 71 + 2 + 44 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 282076979 = 10154771244 / (1 + 0 + 1 + 5 + 4 + 7 + 7 + 1 + 2 + 4 + 4).
It is a junction number, because it is equal to n+sod(n) for n = 10154771199 and 10154771208.
It is not an unprimeable number, because it can be changed into a prime (10154771243) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 141038454 + ... + 141038525.
Almost surely, 210154771244 is an apocalyptic number.
It is an amenable number.
10154771244 is an abundant number, since it is smaller than the sum of its proper divisors (15514233936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10154771244 is a wasteful number, since it uses less digits than its factorization.
10154771244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282076989 (or 282076984 counting only the distinct ones).
The product of its (nonzero) digits is 31360, while the sum is 36.
The spelling of 10154771244 in words is "ten billion, one hundred fifty-four million, seven hundred seventy-one thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •