Base | Representation |
---|---|
bin | 10010111010100000… |
… | …00111111000000101 |
3 | 222012200101010001112 |
4 | 21131100013320011 |
5 | 131244014122440 |
6 | 4355340534405 |
7 | 506431222613 |
oct | 113520077005 |
9 | 28180333045 |
10 | 10154442245 |
11 | 4340a10832 |
12 | 1b74851405 |
13 | c5a9b330c |
14 | 6c48866b3 |
15 | 3e6718965 |
hex | 25d407e05 |
10154442245 has 8 divisors (see below), whose sum is σ = 12514664184. Its totient is φ = 7903998144.
The previous prime is 10154442241. The next prime is 10154442253. The reversal of 10154442245 is 54224445101.
It can be written as a sum of positive squares in 4 ways, for example, as 2733825796 + 7420616449 = 52286^2 + 86143^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10154442245 - 22 = 10154442241 is a prime.
It is a super-2 number, since 2×101544422452 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10154442241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27444254 + ... + 27444623.
It is an arithmetic number, because the mean of its divisors is an integer number (1564333023).
Almost surely, 210154442245 is an apocalyptic number.
It is an amenable number.
10154442245 is a deficient number, since it is larger than the sum of its proper divisors (2360221939).
10154442245 is an equidigital number, since it uses as much as digits as its factorization.
10154442245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54888919.
The product of its (nonzero) digits is 25600, while the sum is 32.
Adding to 10154442245 its reverse (54224445101), we get a palindrome (64378887346).
The spelling of 10154442245 in words is "ten billion, one hundred fifty-four million, four hundred forty-two thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •