Base | Representation |
---|---|
bin | 100000010100011101010111… |
… | …001011101100001011011111 |
3 | 200122021202222022112122100010 |
4 | 200110131113023230023133 |
5 | 122112334143231442310 |
6 | 1222151440130134303 |
7 | 41640344044064355 |
oct | 4024352713541337 |
9 | 618252868478303 |
10 | 142143405343455 |
11 | 413227527110aa |
12 | 13b38416a21393 |
13 | 61410b11b0a89 |
14 | 2715ac57677d5 |
15 | 116772214b320 |
hex | 8147572ec2df |
142143405343455 has 32 divisors (see below), whose sum is σ = 232426272964608. Its totient is φ = 74146401100800.
The previous prime is 142143405343421. The next prime is 142143405343463. The reversal of 142143405343455 is 554343504341241.
It is a happy number.
It is not a de Polignac number, because 142143405343455 - 211 = 142143405341407 is a prime.
It is a super-2 number, since 2×1421434053434552 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67495186 + ... + 69569295.
It is an arithmetic number, because the mean of its divisors is an integer number (7263321030144).
Almost surely, 2142143405343455 is an apocalyptic number.
142143405343455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
142143405343455 is a deficient number, since it is larger than the sum of its proper divisors (90282867621153).
142143405343455 is a wasteful number, since it uses less digits than its factorization.
142143405343455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137066007.
The product of its (nonzero) digits is 6912000, while the sum is 48.
Adding to 142143405343455 its reverse (554343504341241), we get a palindrome (696486909684696).
The spelling of 142143405343455 in words is "one hundred forty-two trillion, one hundred forty-three billion, four hundred five million, three hundred forty-three thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •