Base | Representation |
---|---|
bin | 10110011010100110… |
… | …01111110100011001 |
3 | 1011001200200021000000 |
4 | 23031103033310121 |
5 | 144121240400101 |
6 | 5310053003213 |
7 | 604135641102 |
oct | 131523176431 |
9 | 34050607000 |
10 | 12034309401 |
11 | 5116065854 |
12 | 23ba323509 |
13 | 119a2b814a |
14 | 8223cd3a9 |
15 | 4a679b486 |
hex | 2cd4cfd19 |
12034309401 has 63 divisors (see below), whose sum is σ = 19247540911. Its totient is φ = 7519345344.
The previous prime is 12034309387. The next prime is 12034309403. The reversal of 12034309401 is 10490343021.
The square root of 12034309401 is 109701.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9369272025 + 2665037376 = 96795^2 + 51624^2 .
It is not a de Polignac number, because 12034309401 - 217 = 12034178329 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12034309403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 50352640 + ... + 50352878.
Almost surely, 212034309401 is an apocalyptic number.
12034309401 is the 109701-st square number.
12034309401 is the 54851-st centered octagonal number.
It is an amenable number.
12034309401 is a deficient number, since it is larger than the sum of its proper divisors (7213231510).
12034309401 is an frugal number, since it uses more digits than its factorization.
12034309401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530 (or 259 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 12034309401 in words is "twelve billion, thirty-four million, three hundred nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •