Base | Representation |
---|---|
bin | 1001011110100111001100… |
… | …0111101000101001000010 |
3 | 1100220021202210022121101000 |
4 | 2113221303013220221002 |
5 | 2331221234120311120 |
6 | 34055325305152430 |
7 | 2123634013520604 |
oct | 227516307505102 |
9 | 40807683277330 |
10 | 10421522041410 |
11 | 335881955a6a7 |
12 | 120391678b716 |
13 | 5a798c5b00bc |
14 | 2805937b7174 |
15 | 13114b007990 |
hex | 97a731e8a42 |
10421522041410 has 64 divisors (see below), whose sum is σ = 27838890028800. Its totient is φ = 2774256086016.
The previous prime is 10421522041291. The next prime is 10421522041429. The reversal of 10421522041410 is 1414022512401.
10421522041410 is a `hidden beast` number, since 1 + 0 + 4 + 2 + 15 + 220 + 414 + 10 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33291550 + ... + 33603129.
It is an arithmetic number, because the mean of its divisors is an integer number (434982656700).
Almost surely, 210421522041410 is an apocalyptic number.
10421522041410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10421522041410 is an abundant number, since it is smaller than the sum of its proper divisors (17417367987390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10421522041410 is a wasteful number, since it uses less digits than its factorization.
10421522041410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66895272 (or 66895266 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 27.
Adding to 10421522041410 its reverse (1414022512401), we get a palindrome (11835544553811).
The spelling of 10421522041410 in words is "ten trillion, four hundred twenty-one billion, five hundred twenty-two million, forty-one thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •