Base | Representation |
---|---|
bin | 10010110011011010… |
… | …00010111110100010 |
3 | 222001112100211200220 |
4 | 21121231002332202 |
5 | 131133244243430 |
6 | 4345413023510 |
7 | 505106236332 |
oct | 113155027642 |
9 | 28045324626 |
10 | 10094915490 |
11 | 4310353470 |
12 | 1b58924b96 |
13 | c4b57089a |
14 | 6ba9cd0c2 |
15 | 3e13ab110 |
hex | 259b42fa2 |
10094915490 has 32 divisors (see below), whose sum is σ = 26430325056. Its totient is φ = 2447252160.
The previous prime is 10094915483. The next prime is 10094915521. The reversal of 10094915490 is 9451949001.
It is a happy number.
10094915490 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 15294997 + ... + 15295656.
It is an arithmetic number, because the mean of its divisors is an integer number (825947658).
Almost surely, 210094915490 is an apocalyptic number.
10094915490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10094915490 is an abundant number, since it is smaller than the sum of its proper divisors (16335409566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10094915490 is a wasteful number, since it uses less digits than its factorization.
10094915490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30590674.
The product of its (nonzero) digits is 58320, while the sum is 42.
The spelling of 10094915490 in words is "ten billion, ninety-four million, nine hundred fifteen thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •