Base | Representation |
---|---|
bin | 10011011000011010… |
… | …00111110111111000 |
3 | 222212011102201110111 |
4 | 21230031013313320 |
5 | 132302230022130 |
6 | 4440301554104 |
7 | 515565465352 |
oct | 115415076770 |
9 | 28764381414 |
10 | 10405314040 |
11 | 445a58a4a0 |
12 | 2024875934 |
13 | c9a96c774 |
14 | 709d0c0d2 |
15 | 40d77102a |
hex | 26c347df8 |
10405314040 has 64 divisors (see below), whose sum is σ = 26022267360. Its totient is φ = 3712350720.
The previous prime is 10405314037. The next prime is 10405314047. The reversal of 10405314040 is 4041350401.
It is a super-2 number, since 2×104053140402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10405314047) 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, 199779 + ... + 246418.
Almost surely, 210405314040 is an apocalyptic number.
10405314040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10405314040 is an abundant number, since it is smaller than the sum of its proper divisors (15616953320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10405314040 is a wasteful number, since it uses less digits than its factorization.
10405314040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446272 (or 446268 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 10405314040 its reverse (4041350401), we get a palindrome (14446664441).
The spelling of 10405314040 in words is "ten billion, four hundred five million, three hundred fourteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •