Base | Representation |
---|---|
bin | 10011001100010110… |
… | …11101010001101011 |
3 | 222121010012022110010 |
4 | 21212023131101223 |
5 | 132100334322443 |
6 | 4422251023003 |
7 | 513230242410 |
oct | 114613352153 |
9 | 28533168403 |
10 | 10304214123 |
11 | 4408507645 |
12 | 1bb6a3aa63 |
13 | c82a32428 |
14 | 6da712107 |
15 | 404950733 |
hex | 2662dd46b |
10304214123 has 32 divisors (see below), whose sum is σ = 16229675520. Its totient is φ = 5693391360.
The previous prime is 10304214103. The next prime is 10304214161. The reversal of 10304214123 is 32141240301.
10304214123 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10304214123 - 216 = 10304148587 is a prime.
It is a super-3 number, since 3×103042141233 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 10304214123.
It is not an unprimeable number, because it can be changed into a prime (10304214103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7411 + ... + 143747.
It is an arithmetic number, because the mean of its divisors is an integer number (507177360).
Almost surely, 210304214123 is an apocalyptic number.
10304214123 is a deficient number, since it is larger than the sum of its proper divisors (5925461397).
10304214123 is a wasteful number, since it uses less digits than its factorization.
10304214123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136467.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10304214123 its reverse (32141240301), we get a palindrome (42445454424).
The spelling of 10304214123 in words is "ten billion, three hundred four million, two hundred fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •