Base | Representation |
---|---|
bin | 1000011101010101110… |
… | …1010011111000000110 |
3 | 111220002021002112201012 |
4 | 2013111131103320012 |
5 | 4340101134320431 |
6 | 150431252002222 |
7 | 13333021256300 |
oct | 2072535237006 |
9 | 456067075635 |
10 | 145315151366 |
11 | 5669a684020 |
12 | 241b5900372 |
13 | 1091aac4b88 |
14 | 70674c8970 |
15 | 3ba767b22b |
hex | 21d5753e06 |
145315151366 has 24 divisors (see below), whose sum is σ = 276611032296. Its totient is φ = 56616292320.
The previous prime is 145315151347. The next prime is 145315151393. The reversal of 145315151366 is 663151513541.
145315151366 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1453151513662 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 67399271 + ... + 67401426.
It is an arithmetic number, because the mean of its divisors is an integer number (11525459679).
Almost surely, 2145315151366 is an apocalyptic number.
145315151366 is a deficient number, since it is larger than the sum of its proper divisors (131295880930).
145315151366 is a wasteful number, since it uses less digits than its factorization.
145315151366 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134800724 (or 134800717 counting only the distinct ones).
The product of its digits is 162000, while the sum is 41.
The spelling of 145315151366 in words is "one hundred forty-five billion, three hundred fifteen million, one hundred fifty-one thousand, three hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •