Base | Representation |
---|---|
bin | 100010011011100110011010… |
… | …000011010100001010011001 |
3 | 201212011120221020121202202210 |
4 | 202123212122003110022121 |
5 | 124322013121101442403 |
6 | 1254022032254345333 |
7 | 43616321450432061 |
oct | 4233463203241231 |
9 | 655146836552683 |
10 | 151430246515353 |
11 | 4428323041a183 |
12 | 14b982431bb249 |
13 | 6665a7092a440 |
14 | 2957397ac03a1 |
15 | 12790acb5eb03 |
hex | 89b99a0d4299 |
151430246515353 has 16 divisors (see below), whose sum is σ = 217440441880256. Its totient is φ = 93186927213120.
The previous prime is 151430246515349. The next prime is 151430246515381. The reversal of 151430246515353 is 353515642034151.
It is not a de Polignac number, because 151430246515353 - 22 = 151430246515349 is a prime.
It is a super-2 number, since 2×1514302465153532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151430246510353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15074203 + ... + 23023728.
It is an arithmetic number, because the mean of its divisors is an integer number (13590027617516).
Almost surely, 2151430246515353 is an apocalyptic number.
151430246515353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
151430246515353 is a deficient number, since it is larger than the sum of its proper divisors (66010195364903).
151430246515353 is a wasteful number, since it uses less digits than its factorization.
151430246515353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38199864.
The product of its (nonzero) digits is 3240000, while the sum is 48.
The spelling of 151430246515353 in words is "one hundred fifty-one trillion, four hundred thirty billion, two hundred forty-six million, five hundred fifteen thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •