Base | Representation |
---|---|
bin | 100001000010100100101000… |
… | …010110010001000000000010 |
3 | 201001111201110102011101010022 |
4 | 201002210220112101000002 |
5 | 123021244100143413020 |
6 | 1233015315045133442 |
7 | 42415316251422215 |
oct | 4102445026210002 |
9 | 631451412141108 |
10 | 145312305451010 |
11 | 4233466a163525 |
12 | 1436a5b90ba282 |
13 | 6310b78b24009 |
14 | 27c52201c577c |
15 | 11bed8e876625 |
hex | 842928591002 |
145312305451010 has 16 divisors (see below), whose sum is σ = 261563717216376. Its totient is φ = 58124573868288.
The previous prime is 145312305451009. The next prime is 145312305451031. The reversal of 145312305451010 is 10154503213541.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 143295527713321 + 2016777737689 = 11970611^2 + 1420133^2 .
It is a super-2 number, since 2×1453123054510102 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41783447 + ... + 45127386.
Almost surely, 2145312305451010 is an apocalyptic number.
145312305451010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145312305451010 is a deficient number, since it is larger than the sum of its proper divisors (116251411765366).
145312305451010 is a wasteful number, since it uses less digits than its factorization.
145312305451010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87078037.
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 145312305451010 its reverse (10154503213541), we get a palindrome (155466808664551).
The spelling of 145312305451010 in words is "one hundred forty-five trillion, three hundred twelve billion, three hundred five million, four hundred fifty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •