Base | Representation |
---|---|
bin | 10011001000010101… |
… | …00110010100101101 |
3 | 222111202122010122212 |
4 | 21210022212110231 |
5 | 132013212401410 |
6 | 4415043020205 |
7 | 512340153014 |
oct | 114412462455 |
9 | 28452563585 |
10 | 10270434605 |
11 | 43a0435592 |
12 | 1ba766a665 |
13 | c78a36052 |
14 | 6d603ba7b |
15 | 4019cbb05 |
hex | 2642a652d |
10270434605 has 64 divisors (see below), whose sum is σ = 13630643712. Its totient is φ = 7406530560.
The previous prime is 10270434599. The next prime is 10270434607. The reversal of 10270434605 is 50643407201.
It is not a de Polignac number, because 10270434605 - 24 = 10270434589 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10270434607) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18242054 + ... + 18242616.
It is an arithmetic number, because the mean of its divisors is an integer number (212978808).
Almost surely, 210270434605 is an apocalyptic number.
It is an amenable number.
10270434605 is a deficient number, since it is larger than the sum of its proper divisors (3360209107).
10270434605 is a wasteful number, since it uses less digits than its factorization.
10270434605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758.
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 10270434605 in words is "ten billion, two hundred seventy million, four hundred thirty-four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •