Base | Representation |
---|---|
bin | 10011001000110011… |
… | …01000001010111111 |
3 | 222112001001021221210 |
4 | 21210121220022333 |
5 | 132020214434320 |
6 | 4415303255503 |
7 | 512415512061 |
oct | 114431501277 |
9 | 28461037853 |
10 | 10274374335 |
11 | 43a2686565 |
12 | 1ba8a4a593 |
13 | c797b5354 |
14 | 6d6785731 |
15 | 4020090e0 |
hex | 2646682bf |
10274374335 has 32 divisors (see below), whose sum is σ = 16619359680. Its totient is φ = 5419726848.
The previous prime is 10274374333. The next prime is 10274374339. The reversal of 10274374335 is 53347347201.
10274374335 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10274374335 - 21 = 10274374333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10274374293 and 10274374302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10274374333) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 964257 + ... + 974853.
It is an arithmetic number, because the mean of its divisors is an integer number (519354990).
Almost surely, 210274374335 is an apocalyptic number.
10274374335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10274374335 is a deficient number, since it is larger than the sum of its proper divisors (6344985345).
10274374335 is a wasteful number, since it uses less digits than its factorization.
10274374335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11307.
The product of its (nonzero) digits is 211680, while the sum is 39.
The spelling of 10274374335 in words is "ten billion, two hundred seventy-four million, three hundred seventy-four thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •