Base | Representation |
---|---|
bin | 1000010101100000111… |
… | …0001101010101001011 |
3 | 111200122211111001022100 |
4 | 2011120032031111023 |
5 | 4321300243243040 |
6 | 145442553524443 |
7 | 13226656154316 |
oct | 2053016152513 |
9 | 450584431270 |
10 | 143214040395 |
11 | 55811657278 |
12 | 2390a113723 |
13 | 1067470844a |
14 | 6d0842d97d |
15 | 3ad2e94b30 |
hex | 215838d54b |
143214040395 has 24 divisors (see below), whose sum is σ = 248714174592. Its totient is φ = 76234204800.
The previous prime is 143214040393. The next prime is 143214040447. The reversal of 143214040395 is 593040412341.
143214040395 is a `hidden beast` number, since 14 + 3 + 214 + 0 + 40 + 395 = 666.
It is not a de Polignac number, because 143214040395 - 21 = 143214040393 is a prime.
It is a super-2 number, since 2×1432140403952 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (143214040393) 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 23 ways as a sum of consecutive naturals, for example, 3030811 + ... + 3077700.
It is an arithmetic number, because the mean of its divisors is an integer number (10363090608).
Almost surely, 2143214040395 is an apocalyptic number.
143214040395 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
143214040395 is a deficient number, since it is larger than the sum of its proper divisors (105500134197).
143214040395 is a wasteful number, since it uses less digits than its factorization.
143214040395 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6109043 (or 6109040 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 143214040395 in words is "one hundred forty-three billion, two hundred fourteen million, forty thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •