Base | Representation |
---|---|
bin | 10011001000111011… |
… | …10010000111001110 |
3 | 222112010002122012001 |
4 | 21210131302013032 |
5 | 132021004314010 |
6 | 4415342502514 |
7 | 512430666625 |
oct | 114435620716 |
9 | 28463078161 |
10 | 10275463630 |
11 | 43a325aa03 |
12 | 1ba9294a3a |
13 | c79aa70c3 |
14 | 6d698a6bc |
15 | 402171c3a |
hex | 2647721ce |
10275463630 has 16 divisors (see below), whose sum is σ = 18550724400. Its totient is φ = 4097987712.
The previous prime is 10275463619. The next prime is 10275463631. The reversal of 10275463630 is 3636457201.
10275463630 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102754636302 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10275463630.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10275463631) 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 7 ways as a sum of consecutive naturals, for example, 1521180 + ... + 1527919.
It is an arithmetic number, because the mean of its divisors is an integer number (1159420275).
Almost surely, 210275463630 is an apocalyptic number.
10275463630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10275463630 is a deficient number, since it is larger than the sum of its proper divisors (8275260770).
10275463630 is a wasteful number, since it uses less digits than its factorization.
10275463630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3049443.
The product of its (nonzero) digits is 90720, while the sum is 37.
The spelling of 10275463630 in words is "ten billion, two hundred seventy-five million, four hundred sixty-three thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •