Base | Representation |
---|---|
bin | 11010011110010101… |
… | …01100000110011111 |
3 | 1100200112110111100102 |
4 | 31033022230012133 |
5 | 213102023312111 |
6 | 10310204051315 |
7 | 1012133251040 |
oct | 151712540637 |
9 | 40615414312 |
10 | 14213104031 |
11 | 6033a21475 |
12 | 2907b33b3b |
13 | 1456803839 |
14 | 98b90a8c7 |
15 | 582bca13b |
hex | 34f2ac19f |
14213104031 has 8 divisors (see below), whose sum is σ = 17199050400. Its totient is φ = 11466033408.
The previous prime is 14213104001. The next prime is 14213104051. The reversal of 14213104031 is 13040131241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14213104031 - 230 = 13139362207 is a prime.
It is a super-2 number, since 2×142131040312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14213103994 and 14213104012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14213104001) 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 7 ways as a sum of consecutive naturals, for example, 59718806 + ... + 59719043.
It is an arithmetic number, because the mean of its divisors is an integer number (2149881300).
Almost surely, 214213104031 is an apocalyptic number.
14213104031 is a deficient number, since it is larger than the sum of its proper divisors (2985946369).
14213104031 is a wasteful number, since it uses less digits than its factorization.
14213104031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119437873.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 14213104031 its reverse (13040131241), we get a palindrome (27253235272).
The spelling of 14213104031 in words is "fourteen billion, two hundred thirteen million, one hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •