Base | Representation |
---|---|
bin | 1000010001110110101… |
… | …0001110101111100001 |
3 | 111121010100201101001200 |
4 | 2010131222032233201 |
5 | 4312242232433330 |
6 | 145201255151413 |
7 | 13163426030013 |
oct | 2043552165741 |
9 | 447110641050 |
10 | 142231530465 |
11 | 55357a99aa2 |
12 | 23695075569 |
13 | 10548cb311b |
14 | 6c53b561b3 |
15 | 3a76abaa60 |
hex | 211da8ebe1 |
142231530465 has 24 divisors (see below), whose sum is σ = 246769306368. Its totient is φ = 75784615200.
The previous prime is 142231530439. The next prime is 142231530487. The reversal of 142231530465 is 564035132241.
142231530465 is a `hidden beast` number, since 1 + 42 + 2 + 3 + 153 + 0 + 465 = 666.
142231530465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 142231530465 - 212 = 142231526369 is a prime.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1456369 + ... + 1550958.
It is an arithmetic number, because the mean of its divisors is an integer number (10282054432).
Almost surely, 2142231530465 is an apocalyptic number.
142231530465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142231530465 is a deficient number, since it is larger than the sum of its proper divisors (104537775903).
142231530465 is a wasteful number, since it uses less digits than its factorization.
142231530465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3008389 (or 3008386 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 142231530465 in words is "one hundred forty-two billion, two hundred thirty-one million, five hundred thirty thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •