Base | Representation |
---|---|
bin | 100010001000001… |
… | …0010101011111010 |
3 | 2221210202012102112 |
4 | 1010100102223322 |
5 | 4321122342110 |
6 | 305343532322 |
7 | 40243241510 |
oct | 10420225372 |
9 | 2853665375 |
10 | 1145121530 |
11 | 538433833 |
12 | 27b5ba0a2 |
13 | 15331b707 |
14 | ac1264b0 |
15 | 6a7ea405 |
hex | 44412afa |
1145121530 has 64 divisors (see below), whose sum is σ = 2500388352. Its totient is φ = 368609280.
The previous prime is 1145121529. The next prime is 1145121541. The reversal of 1145121530 is 351215411.
It is a super-2 number, since 2×11451215302 = 2622606636939081800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145121496 and 1145121505.
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 31 ways as a sum of consecutive naturals, for example, 619067 + ... + 620913.
It is an arithmetic number, because the mean of its divisors is an integer number (39068568).
Almost surely, 21145121530 is an apocalyptic number.
1145121530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1145121530 is an abundant number, since it is smaller than the sum of its proper divisors (1355266822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145121530 is a wasteful number, since it uses less digits than its factorization.
1145121530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2399.
The product of its (nonzero) digits is 600, while the sum is 23.
The square root of 1145121530 is about 33839.6443539231. The cubic root of 1145121530 is about 1046.2059686747.
Adding to 1145121530 its reverse (351215411), we get a palindrome (1496336941).
The spelling of 1145121530 in words is "one billion, one hundred forty-five million, one hundred twenty-one thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •