Base | Representation |
---|---|
bin | 11000011010000110… |
… | …11111110001011110 |
3 | 1020211020100020000110 |
4 | 30031003133301132 |
5 | 203314101003040 |
6 | 10004142310450 |
7 | 642504334005 |
oct | 141503376136 |
9 | 36736306013 |
10 | 13103922270 |
11 | 561490582a |
12 | 2658588426 |
13 | 130aa8987a |
14 | 8c449bc3c |
15 | 51a62d980 |
hex | 30d0dfc5e |
13103922270 has 32 divisors (see below), whose sum is σ = 32463912960. Its totient is φ = 3381657120.
The previous prime is 13103922253. The next prime is 13103922277. The reversal of 13103922270 is 7222930131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103922277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7044190 + ... + 7046049.
It is an arithmetic number, because the mean of its divisors is an integer number (1014497280).
Almost surely, 213103922270 is an apocalyptic number.
13103922270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13103922270 is an abundant number, since it is smaller than the sum of its proper divisors (19359990690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13103922270 is a wasteful number, since it uses less digits than its factorization.
13103922270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14090280.
The product of its (nonzero) digits is 4536, while the sum is 30.
The spelling of 13103922270 in words is "thirteen billion, one hundred three million, nine hundred twenty-two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •