Base | Representation |
---|---|
bin | 10111100000110100001100… |
… | …101110001001100001110000 |
3 | 111120010220122112020212020210 |
4 | 113200310030232021201300 |
5 | 102023232432044310112 |
6 | 1003533543555304120 |
7 | 30532064460360303 |
oct | 2740641456114160 |
9 | 446126575225223 |
10 | 103410141010032 |
11 | 2aa49aa378117a |
12 | b7216b2bab040 |
13 | 45916c427361c |
14 | 1b77112a58b3a |
15 | be4e05d70b3c |
hex | 5e0d0cb89870 |
103410141010032 has 40 divisors (see below), whose sum is σ = 281203015029760. Its totient is φ = 32655834002880.
The previous prime is 103410141009997. The next prime is 103410141010063. The reversal of 103410141010032 is 230010141014301.
It is a junction number, because it is equal to n+sod(n) for n = 103410141009990 and 103410141010008.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56694155344 + ... + 56694157167.
It is an arithmetic number, because the mean of its divisors is an integer number (7030075375744).
Almost surely, 2103410141010032 is an apocalyptic number.
103410141010032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103410141010032 is an abundant number, since it is smaller than the sum of its proper divisors (177792874019728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103410141010032 is a wasteful number, since it uses less digits than its factorization.
103410141010032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113388312541 (or 113388312535 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 103410141010032 its reverse (230010141014301), we get a palindrome (333420282024333).
The spelling of 103410141010032 in words is "one hundred three trillion, four hundred ten billion, one hundred forty-one million, ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •