Base | Representation |
---|---|
bin | 1010100001110010101111… |
… | …01100011110101110111011 |
3 | 10000222020200001001112212001 |
4 | 11100321113230132232323 |
5 | 11013302423310102301 |
6 | 121123325302201431 |
7 | 4606425624415060 |
oct | 520712754365673 |
9 | 100866601045761 |
10 | 23151345003451 |
11 | 7416480777965 |
12 | 271aa76723277 |
13 | cbc215c27102 |
14 | 5a07613bcc67 |
15 | 2a23462d8c01 |
hex | 150e57b1ebbb |
23151345003451 has 8 divisors (see below), whose sum is σ = 26499574414080. Its totient is φ = 19813339195368.
The previous prime is 23151345003433. The next prime is 23151345003511. The reversal of 23151345003451 is 15430054315132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23151345003451 - 233 = 23142755068859 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23151345003451.
It is not an unprimeable number, because it can be changed into a prime (23151345003151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2555895781 + ... + 2555904838.
It is an arithmetic number, because the mean of its divisors is an integer number (3312446801760).
Almost surely, 223151345003451 is an apocalyptic number.
23151345003451 is a deficient number, since it is larger than the sum of its proper divisors (3348229410629).
23151345003451 is an equidigital number, since it uses as much as digits as its factorization.
23151345003451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5111801273.
The product of its (nonzero) digits is 108000, while the sum is 37.
Adding to 23151345003451 its reverse (15430054315132), we get a palindrome (38581399318583).
The spelling of 23151345003451 in words is "twenty-three trillion, one hundred fifty-one billion, three hundred forty-five million, three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •