Base | Representation |
---|---|
bin | 10011010100000101… |
… | …01000101101000100 |
3 | 222202122010022100221 |
4 | 21222002220231010 |
5 | 132213431314000 |
6 | 4432523514124 |
7 | 514645064212 |
oct | 115202505504 |
9 | 28678108327 |
10 | 10369010500 |
11 | 4441044072 |
12 | 2014688944 |
13 | c9329b594 |
14 | 70517bcb2 |
15 | 40a49e61a |
hex | 26a0a8b44 |
10369010500 has 24 divisors (see below), whose sum is σ = 22645920024. Its totient is φ = 4147604000.
The previous prime is 10369010453. The next prime is 10369010513. The reversal of 10369010500 is 501096301.
It can be written as a sum of positive squares in 4 ways, for example, as 620607744 + 9748402756 = 24912^2 + 98734^2 .
It is a super-2 number, since 2×103690105002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10368511 + ... + 10369510.
It is an arithmetic number, because the mean of its divisors is an integer number (943580001).
Almost surely, 210369010500 is an apocalyptic number.
10369010500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10369010500 is an abundant number, since it is smaller than the sum of its proper divisors (12276909524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10369010500 is a wasteful number, since it uses less digits than its factorization.
10369010500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20738040 (or 20738028 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 25.
The spelling of 10369010500 in words is "ten billion, three hundred sixty-nine million, ten thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •