Base | Representation |
---|---|
bin | 10010101101001111… |
… | …10100100100101010 |
3 | 221220221002010202102 |
4 | 21112213310210222 |
5 | 131032030322442 |
6 | 4340324533402 |
7 | 503610624434 |
oct | 112647644452 |
9 | 27827063672 |
10 | 10043214122 |
11 | 4294150467 |
12 | 1b43551262 |
13 | c4093ac66 |
14 | 6b3bb1654 |
15 | 3dba97232 |
hex | 2569f492a |
10043214122 has 16 divisors (see below), whose sum is σ = 15445406592. Its totient is φ = 4894954080.
The previous prime is 10043214107. The next prime is 10043214127. The reversal of 10043214122 is 22141234001.
10043214122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×100432141223 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10043214094 and 10043214103.
It is not an unprimeable number, because it can be changed into a prime (10043214127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45743 + ... + 148925.
It is an arithmetic number, because the mean of its divisors is an integer number (965337912).
Almost surely, 210043214122 is an apocalyptic number.
10043214122 is a deficient number, since it is larger than the sum of its proper divisors (5402192470).
10043214122 is a wasteful number, since it uses less digits than its factorization.
10043214122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104413.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10043214122 its reverse (22141234001), we get a palindrome (32184448123).
The spelling of 10043214122 in words is "ten billion, forty-three million, two hundred fourteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •