Base | Representation |
---|---|
bin | 11111111000001111010010… |
… | …110110110010100010001100 |
3 | 200101102101102121221012000000 |
4 | 133320033102312302202030 |
5 | 121334101102141141302 |
6 | 1214104522153404300 |
7 | 41350262443242204 |
oct | 3770172266624214 |
9 | 611371377835000 |
10 | 140204155021452 |
11 | 40745280438575 |
12 | 13884607a09690 |
13 | 603026c7ba942 |
14 | 2689cbb157404 |
15 | 113207260831c |
hex | 7f83d2db288c |
140204155021452 has 168 divisors, whose sum is σ = 397794282814656. Its totient is φ = 43049752349184.
The previous prime is 140204155021429. The next prime is 140204155021477. The reversal of 140204155021452 is 254120551402041.
140204155021452 is a `hidden beast` number, since 1 + 4 + 0 + 2 + 0 + 4 + 1 + 5 + 502 + 145 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 27758343 + ... + 32418110.
It is an arithmetic number, because the mean of its divisors is an integer number (2367823111992).
Almost surely, 2140204155021452 is an apocalyptic number.
140204155021452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
140204155021452 is an abundant number, since it is smaller than the sum of its proper divisors (257590127793204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140204155021452 is a wasteful number, since it uses less digits than its factorization.
140204155021452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60176539 (or 60176522 counting only the distinct ones).
The product of its (nonzero) digits is 64000, while the sum is 36.
The spelling of 140204155021452 in words is "one hundred forty trillion, two hundred four billion, one hundred fifty-five million, twenty-one thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •