Base | Representation |
---|---|
bin | 10010101100001010… |
… | …00011100000000111 |
3 | 221220021221002211220 |
4 | 21112011003200013 |
5 | 131022212201411 |
6 | 4335401331423 |
7 | 503440305351 |
oct | 112605034007 |
9 | 27807832756 |
10 | 10034100231 |
11 | 4289a96021 |
12 | 1b40496b73 |
13 | c3ba9981c |
14 | 6b28bc0d1 |
15 | 3dad96b06 |
hex | 256143807 |
10034100231 has 4 divisors (see below), whose sum is σ = 13378800312. Its totient is φ = 6689400152.
The previous prime is 10034100199. The next prime is 10034100257. The reversal of 10034100231 is 13200143001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10034100231 - 25 = 10034100199 is a prime.
It is a super-2 number, since 2×100341002312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10034100231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10034100331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1672350036 + ... + 1672350041.
It is an arithmetic number, because the mean of its divisors is an integer number (3344700078).
Almost surely, 210034100231 is an apocalyptic number.
10034100231 is a deficient number, since it is larger than the sum of its proper divisors (3344700081).
10034100231 is an equidigital number, since it uses as much as digits as its factorization.
10034100231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3344700080.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10034100231 its reverse (13200143001), we get a palindrome (23234243232).
The spelling of 10034100231 in words is "ten billion, thirty-four million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •