Base | Representation |
---|---|
bin | 100010011011111011001000… |
… | …110000110010001000100101 |
3 | 201212020201101110221010002101 |
4 | 202123323020300302020211 |
5 | 124322344212241214023 |
6 | 1254040153103412101 |
7 | 43621040155555315 |
oct | 4233731060621045 |
9 | 655221343833071 |
10 | 151452505023013 |
11 | 442917127aa457 |
12 | 14ba06155b4031 |
13 | 6667baa1b032c |
14 | 29584a9d13445 |
15 | 1279961d031ad |
hex | 89bec8c32225 |
151452505023013 has 16 divisors (see below), whose sum is σ = 153446367880960. Its totient is φ = 149460575846400.
The previous prime is 151452505023007. The next prime is 151452505023049. The reversal of 151452505023013 is 310320505254151.
It is a cyclic number.
It is not a de Polignac number, because 151452505023013 - 245 = 116268132934181 is a prime.
It is a super-2 number, since 2×1514525050230132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151452502023013) 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, 1760684581 + ... + 1760770597.
It is an arithmetic number, because the mean of its divisors is an integer number (9590397992560).
Almost surely, 2151452505023013 is an apocalyptic number.
It is an amenable number.
151452505023013 is a deficient number, since it is larger than the sum of its proper divisors (1993862857947).
151452505023013 is an equidigital number, since it uses as much as digits as its factorization.
151452505023013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96988.
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 151452505023013 in words is "one hundred fifty-one trillion, four hundred fifty-two billion, five hundred five million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •