Base | Representation |
---|---|
bin | 10010101011101010… |
… | …11100111111100101 |
3 | 221220000020022120111 |
4 | 21111311130333211 |
5 | 131020140312331 |
6 | 4335133533021 |
7 | 503360452441 |
oct | 112565347745 |
9 | 27800208514 |
10 | 10030010341 |
11 | 428775224a |
12 | 1b3b044171 |
13 | c3ac97080 |
14 | 6b2135821 |
15 | 3da839db1 |
hex | 255d5cfe5 |
10030010341 has 8 divisors (see below), whose sum is σ = 10802577240. Its totient is φ = 9257590272.
The previous prime is 10030010327. The next prime is 10030010369. The reversal of 10030010341 is 14301003001.
It can be written as a sum of positive squares in 4 ways, for example, as 2620416100 + 7409594241 = 51190^2 + 86079^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10030010341 - 213 = 10030002149 is a prime.
It is a super-2 number, since 2×100300103412 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10030010381) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134925 + ... + 195613.
It is an arithmetic number, because the mean of its divisors is an integer number (1350322155).
Almost surely, 210030010341 is an apocalyptic number.
It is an amenable number.
10030010341 is a deficient number, since it is larger than the sum of its proper divisors (772566899).
10030010341 is a wasteful number, since it uses less digits than its factorization.
10030010341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73415.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 10030010341 its reverse (14301003001), we get a palindrome (24331013342).
The spelling of 10030010341 in words is "ten billion, thirty million, ten thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •