Base | Representation |
---|---|
bin | 1001011110001011010101… |
… | …0101101111110011001100 |
3 | 1100212120110120101010210100 |
4 | 2113202311111233303030 |
5 | 2331110430013234122 |
6 | 34052051221411100 |
7 | 2123250460552665 |
oct | 227426525576314 |
9 | 40776416333710 |
10 | 10414043102412 |
11 | 3355630924084 |
12 | 1202389b69a90 |
13 | 5a7069cb7401 |
14 | 2800843c836c |
15 | 130d5e635aac |
hex | 978b556fccc |
10414043102412 has 36 divisors (see below), whose sum is σ = 26348471356480. Its totient is φ = 3468171706272.
The previous prime is 10414043102381. The next prime is 10414043102413. The reversal of 10414043102412 is 21420134041401.
10414043102412 is a `hidden beast` number, since 1 + 0 + 4 + 1 + 404 + 3 + 10 + 241 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (10414043102413) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 132293212 + ... + 132371907.
Almost surely, 210414043102412 is an apocalyptic number.
10414043102412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10414043102412 is an abundant number, since it is smaller than the sum of its proper divisors (15934428254068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10414043102412 is a wasteful number, since it uses less digits than its factorization.
10414043102412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264666222 (or 264666217 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 10414043102412 its reverse (21420134041401), we get a palindrome (31834177143813).
The spelling of 10414043102412 in words is "ten trillion, four hundred fourteen billion, forty-three million, one hundred two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •